Transport network

ABSTRACT

Some embodiments provide a method of monitoring the implementation of a user design in a configurable integrated circuit (IC). The method receives a user design for an IC and optimizes the user design to produce a second IC design. The optimization results in the elimination of circuit element(s). The method defines the second IC design for the configurable IC and generates output data for the eliminated circuit element(s) to allow for monitoring the user design.

CLAIM OF BENEFIT TO PRIOR APPLICATIONS

This Application is a continuation application of U.S. patentapplication Ser. No. 13/291,087, filed on Nov. 7, 2011, now published asU.S. Publication 2012/0117525. U.S. patent application Ser. No.13/291,087 is a continuation application of U.S. patent application Ser.No. 11/769,680, filed on Jun. 27, 2007, now issued as U.S. Pat. No.8,069,425. U.S. patent application Ser. No. 13/291,087, now published asU.S. Publication 2012/0117525 and U.S. Pat. No. 8,069,425 areincorporated herein by reference.

FIELD OF THE INVENTION

The present invention is directed towards accessing multiple user statesconcurrently in a configurable IC.

BACKGROUND OF THE INVENTION

The use of configurable integrated circuits (“ICs”) has dramaticallyincreased in recent years. Configurable ICs can be used to implementcircuits designed by a user (“user design”) on an IC without having tofabricate a new IC for each design. One example of a configurable IC isa field programmable gate array (“FPGA”). An FPGA is a fieldprogrammable IC that usually has configurable logic and interconnectcircuits that are surrounded by input/output (“I/O”) circuits.

The configurable logic circuits (also called logic blocks) are typicallyarranged as an internal array of circuits. A configurable logic circuitcan be configured to perform a number of different functions. Aconfigurable logic circuit typically receives a set of input data and aset of configuration data that is often stored close to the logiccircuit. From the set of functions that the logic circuit can perform,the configuration data set specifies a particular function that thiscircuit is to perform on the input data set. Such a logic circuit issaid to be configurable, as the configuration data set “configures” thelogic circuit to perform a particular function.

These logic circuits are connected together through numerousconfigurable interconnect circuits (also called interconnects). Aconfigurable interconnect circuit connects one or more of a set ofcircuit elements to another set of circuit elements based on a set ofconfiguration data that it receives. The configuration bits specify howthe interconnect circuit should connect the input data set to the outputdata set. The interconnect circuit is said to be configurable, as theconfiguration data set “configures” the interconnect circuit to use aparticular connection scheme that connects the input data set to theoutput data set in a desired manner. In some FPGAs, the configurationdata set of a configurable logic or interconnect set can be modified bywriting new data in SRAM cells that store the configuration data set.

Designing a configuration for a configurable IC requires debugging toolsto help track errors in the design. Such debugging tools generally havesoftware components and circuitry components. In some earlierconfigurable ICs, the debugging circuitry was integrated into the mainbody of the integrated circuit. In some cases, the debugging circuitrywas implemented using the basic configurable circuits. In other cases,the debugging circuitry was fixed function circuitry that was to be usedfor debugging purposes only, but which was physically located among theconfigurable circuits. However, those implementations both haddrawbacks. Implementing the debugging circuitry using the basicconfigurable circuits meant that the debugging circuitry occupiedconfigurable circuits that could otherwise be used for implementing theuser design on the IC. Implementing the debugging circuitry primarily asfixed function circuitry located among the configurable circuits meantthat the debugging circuitry could not be readily redesigned. Forinstance, making the debugging circuitry larger would requireredesigning the main configurable IC to move the configurable circuitsout of the way of the larger debugging circuitry.

Therefore, there is a need in the art for debugging circuits positionedoutside of the ordinary configurable circuits of configurable ICs.Ideally, the mechanism for loading configuration data could also be usedto carry data to circuits used to monitor and debug the configurable IC,with some support within individual logic blocks for routing signalsonto and off of the configuration/debug network.

SUMMARY OF THE INVENTION

Some embodiments provide a method of monitoring the implementation of auser design in a configurable integrated circuit (IC). The methodreceives a user design for an IC and optimizes the user design toproduce a second IC design. The optimization results in the eliminationof circuit element(s). The method defines the second IC design for theconfigurable IC and generates output data for the eliminated circuitelement(s) to allow for monitoring the user design.

In some embodiments, the method, while optimizing the user design,generates a record of the circuit element(s). In some embodiments, themethod, in generating the output data, uses the record to reconstructthe output data from a set of data produced by the configurable IC. Insome embodiments, the method identifies input(s) in the second designthat is/are not directly readable on the configurable IC and identifiesa set of circuit elements that determine the value(s) of the input(s).The method maintains a record of the set of circuit elements.

In some embodiments, the optimization includes retiming of the userdesign. In some such embodiments retiming moves element(s) for producinga delay in the user design to a different location in the second ICdesign. In some embodiments the method maintains a record of theretiming in order to generate the output data. In some embodiments theretiming removes the element from a first location and adds a secondelement for producing delay to a second location. The retiming, inmoving the element for producing the delay, in some embodiments movesthe element from an input of a circuit element to an output of thecircuit element. In some embodiments the generating is from data fromcircuit elements in the second IC design. In some embodiments the methodimplements the second IC design on the configurable IC. In some suchembodiments the generating is from data from circuit elements inimplementation of the second IC design.

Some embodiments provide a computer readable medium containinginstructions for restructuring a circuit design. The instructionsreceive a first circuit design and optimize the first circuit designinto a second circuit design. The optimization removes circuitelement(s) of the circuit design and maintains a record of the circuitelement(s) in the second circuit design in order to reconstruct datavalues during a run time.

In some embodiments the record comprises data representations of a setof inputs comprising at least one input and a set of circuit elementscomprising at least one circuit element. In some embodiments theinstructions further identify input(s) in the second circuit design thatis/are not directly readable. The instructions identify a set of circuitelements that determine the value(s) of the input(s). The instructionsmaintain a record of the set of circuit elements for reconstructing theelement(s). The optimization, in removing a circuit element, in someembodiments, eliminates the circuit element from a set of activeelements.

Some embodiments provide a computer readable medium containinginstructions for restructuring a circuit design. The instructionsreceive a first circuit design and translate the first circuit designinto a second circuit design. The translation moves element(s) forproducing a delay in the circuit design and maintains a record of thedelay in the second circuit design.

In some embodiments the record comprises data representations of a timeshift for compensating for the moving. In some embodiments theinstructions further identify input(s) in the second design that is/arenot directly readable. The instructions identify a set of circuitelements that determine the value of the input(s). The instructionsmaintain a record of the set of circuit elements. In some embodiments,the translation, in moving the element for producing the delay, removesthe element from a first location and adds a second element forproducing delay to a second location. In some embodiments, thetranslation, in moving the element for producing the delay, moves theelement from an input of a circuit element to an output of the circuitelement.

Some embodiments provide a method of restructuring a circuit design forimplementing the circuit design on a reconfigurable integrated circuit.The method receives a first circuit design and translates the firstcircuit design into a second circuit design. The translation removescircuit element(s) of the circuit design and maintains a record of thecircuit element(s) in the second circuit design. The second circuitdesign is a design that is for implementing on a reconfigurable IC.

Some embodiments provide a method of restructuring a circuit design. Themethod optimizes the circuit design. The optimization eliminatesoutput(s) of a circuit in the circuit design and maintains data forreconstructing the output(s). In some embodiments the optimizationreplaces a first set of logic gates with a second set of logic gates.

Some embodiments provide a method of restructuring a circuit design. Themethod receives a first circuit design and optimizes the first circuitdesign into a second circuit design. The optimization removes circuitelement(s) of the circuit design and maintains a record of the circuitelement(s) in the second circuit design. The record is forreconstructing an output value for the removed circuit element(s). Insome embodiments the record comprises data representations of a set ofinputs comprising at least one input and a set of circuit elementscomprising at least one circuit element. In some embodiments, theoptimization, in removing a circuit element, eliminates the circuitelement from a set of active elements.

BRIEF DESCRIPTION OF THE DRAWINGS

The novel features of the invention are set forth in the appendedclaims. However, for purpose of explanation, several embodiments of theinvention are set forth in the following figures.

FIG. 1 illustrates an example of a configurable IC that includesnumerous configurable tiles and a transport network.

FIG. 2 illustrates an example of a data packet.

FIGS. 3, 4, and 5 illustrate an example of how an initial set of framesin a packet might specify the routing of a packet to a configurabletile.

FIG. 6 illustrates the configurable circuit architecture of someembodiments of the invention.

FIGS. 7 a-7 b provide two possible physical architectures of theconfigurable IC illustrated in FIG. 6.

FIG. 8 illustrates a configurable IC with a configuration/debugcontroller.

FIG. 9 illustrates a configurable IC with transport network anddebugging circuits.

FIG. 10 illustrates part of a partial crossbar of some embodiments.

FIG. 11 illustrates elements of a transport network layer of somealternative embodiments.

FIG. 12 illustrates a flowchart of IC configuration.

FIG. 13 illustrates a more detailed view of a configurable IC of someembodiments.

FIG. 14 illustrates a set of data values coming into deskew circuits atset intervals.

FIG. 15 illustrates a pair of 1-bit deskew circuits of some embodiments.

FIGS. 16-19 illustrate the process of deskewing 1-bit data.

FIG. 20 illustrates deskewed data.

FIG. 21 illustrates a detailed view of multi-input deskew circuits ofsome embodiments.

FIG. 22 illustrates an overview of several multi-input deskew circuitsof some embodiments.

FIG. 23 illustrates two multi-bit variables to be deskewed.

FIG. 24 illustrates multiple instances of two multi-bit variables to bedeskewed.

FIG. 25 illustrates inputs of three different multi-bit deskew circuitsof some alternate embodiments.

FIG. 26 illustrates an overview of debug circuitry of the alternateembodiments of FIG. 25.

FIG. 27 illustrates a flowchart of software deskewing of trace bufferdata.

FIG. 28 illustrates a flowchart of software translating a user designinto a configuration of a configurable IC.

FIG. 29 illustrates conversion of a user design into a configuration ofa configurable IC.

FIG. 30 illustrates an example of a more complex optimization operation.

FIG. 31 illustrates conversion of a second user design into aconfiguration of a configurable IC.

FIG. 32 illustrates conversion of a third user design into aconfiguration of a configurable IC.

FIG. 33 illustrates a further adaptation of name cells in embodimentswhere not all outputs of elements on the tiles are directly accessible.

FIG. 34 illustrates a flowchart of software reconfiguring the IC to finddebug values dynamically.

FIGS. 35 a-35 b illustrate a congested condition on a column of tiles.

FIG. 36 illustrates a system on chip (“SoC”) implementation of aconfigurable IC of some embodiments.

FIG. 37 illustrates a computer system used to implement some embodimentsof the invention.

DETAILED DESCRIPTION

In the following description, numerous details are set forth for purposeof explanation. However, one of ordinary skill in the art will realizethat the invention may be practiced without the use of these specificdetails. In other instances, well-known structures and devices are shownin block diagram form in order not to obscure the description of theinvention with unnecessary detail.

I. Overview

A. Brief Overview

The following is a very brief description of some embodiments of thepresent inventions. The description is intended as a framework forunderstanding the more detailed descriptions below. The more detaileddescriptions below may describe embodiments different from thoseindicated by the very brief description.

Some embodiments include configurable ICs with an array of conceptualtiles; other embodiments have configurable circuits arranged in othermanners or arrangements. The configurable ICs also include a network ofconnections used to send configuration information to tiles and receivedebug data from tiles. Some embodiments have debug networks that arepart of the configuration networks; other embodiments have separatedebug networks.

The configuration/debug network takes debug data from the array, andsends it out of the array to a transport network (sometimes called an“output network”). The transport networks of some embodiments haveconfigurable circuits that determine which debug data coming from thearray will be passed on to other parts of the debug system. In someembodiments, the transport network can be considered part of the debugnetwork.

The transport network sends data to a trace buffer that stores the data,and to a trigger block that tells the trace buffer when to stopaccepting incoming data and start sending the stored data off the IC tobe analyzed. The data from the user circuit on the configurable ICactivates the trigger.

Data bits generated at the same time do not generally arrive at thetransport network at the same time. Data bits from different circuitelements of the configurable tiles may arrive at the transport networkout of order (skewed) because the time for a data bit to reach thetransport network depends on various factors that are not the same forevery element.

The trigger needs this data to be in order (i.e. the simultaneouslygenerated bits need to reach the trigger at the same time). To put thedata in order (deskew the data), the data is passed through configurabledeskew circuits that are configured to delay each bit just the rightamount so that those user signals generated simultaneously reach thetrigger block simultaneously.

Various methods are used to control and configure the configurable IC.The method of some embodiments takes a design of a circuit provided by auser and translates the design into a configuration usable by theconfigurable IC. While translating, the method prepares an “equivalencemap” that will make it easier to translate raw debug data into moreusable forms. In some embodiments, the translation of the design changesthe circuit in a way that eliminates some outputs of the originaldesign. In some of such embodiments, the equivalence maps can be usedfor (among other things) regenerating those outputs from data valuesthat are readable in the configuration used by the configurable IC.

In some embodiments, the methods use the maps to determine whichelements of the configurable IC should be observed in order toregenerate the values of the outputs of the user circuit. Theconfigurable circuits, transport network, deskew circuits, and triggerare configured, to implement the user's design, collect raw debug data,and determine the circumstances under which the trigger should fire.When the trigger fires, the method receives the raw data and uses the“maps” to translate the raw debug data into data of interest to theuser. In some embodiments, the method can update maps during run time tokeep track of different elements of the user's design.

B. Exemplary Architecture of Some Embodiments

Some embodiments of the invention provide a configuration/debug networkfor configuring and debugging a configurable integrated circuit (“IC”).An integrated circuit (“IC”) is a device that includes numerouselectronic components (e.g., transistors, resistors, diodes, etc.) thatare embedded typically on the same substrate, such as a single piece ofsemiconductor wafer (e.g., a single chip). These components areconnected with one or more layers of wiring to form multiple circuits,such as Boolean gates, memory cells, arithmetic units, controllers,decoders, etc. An IC is often packaged as a single IC chip in one ICpackage, although some IC chip packages can include multiple pieces ofsubstrate or wafer.

The configurable IC in some embodiments includes configurable resources(e.g., configurable logic resources, routing resources, memoryresources, etc.) that can be grouped in conceptual configurable tilesthat are arranged in several rows and columns. FIG. 1 illustrates anexample of a configurable IC 100 that includes numerous configurabletiles 105. As shown in this figure, each configurable tile 105 receivesa set of lines 110 that are part of a configuration/debug network. Thelines 110 pass debug data on to transport network 115, which in turnpasses the debug data on to other components (not shown). In someembodiments, as shown in this figure, the transport network is separatedby some distance from the configurable tiles 105, outside the tilearray, but still on the same IC. In some embodiments, there is an unusedarea of the IC between the configurable tiles 105 and the transportnetwork 115. Having such a separation solves some of the problemsdescribed in the Background section. For example, having the transportnetwork be separate from the main set of configurable circuits allowsmultiple generations of the configurable IC to use different designs forthe transport network without disrupting the design of the fabric of themain configurable circuits. Some embodiments use a packet switchingtechnology to route data to and from the resources in the configurabletiles. Hence, over the lines 110, these embodiments can route variablelength data packets to each configurable tile in a sequential or randomaccess manner.

FIG. 2 illustrates an example of a data packet 200. As shown in thisfigure, the data packet 200 includes several data frames 205. In someembodiments, an initial set of frames (e.g., first one or two frames) ofthe packet identifies configurable tiles for routing the remainingframes of the data packet. These remaining frames can then containconfiguration and/or debug data for configuring the tile or performingdebug operations on the tile.

FIGS. 3, 4, and 5 illustrate an example of how an initial set of framesin a packet might specify the routing of a packet to a configurable tile315. In this example, the first two frames 305 and 310 of the packet 300respectively identify the column and then the row of the configurabletile 315 to be configured. As shown in FIG. 4, the column-identifyingframe 305 is used by a column selector at the top of the configurabletile array 325 to route a packet down the column of the addressedconfigurable tile 315. The tile-identifying frame 310 then allows a tileselector in the configurable tile 315 to realize that the packet of databeing routed down its column is addressed to its tile 315, as shown inFIG. 5. Hence, as shown in this figure, the tile selector of tile 315extracts the remaining data frames in the packet 300.

The configurable IC includes numerous user-design state elements (“UDSelements”) in some embodiments. UDS elements are elements that storevalues that at any particular time define the overall user-design stateof the configurable IC at that particular time. Examples of suchelements include storage elements (e.g., latches, registers, memories,etc). The configurable IC of some embodiments might not include all suchforms of UDS elements, or might include other types of UDS elements.

In addition to traditional latches, registers, and memory structures,some embodiments use novel UDS storage elements that are described inU.S. Pat. No. 7,224,181 and U.S. patent application Ser. No. 11/754,300,now issued as U.S. Pat. No.7,521,959. Examples of such UDS storageelements include RMUXs that can serve as storage elements, RMUXs thathave storage elements in feedback paths between their outputs andinputs, and storage elements at other locations in the routing fabric(e.g., between RMUXs).

More specifically, some embodiments have routing multiplexers (“RMUXs”)where at least some of the RMUXs have state elements integrated at theoutput stage of the RMUX itself. As further described below in SectionII, such RMUXs are referred to as routing circuit latches or RCLs. Inconjunction or instead of such RCLs, other embodiments utilize otherstorage elements for storing UDS data at other locations in theconfigurable routing fabric of a configurable IC. For instance, inaddition to having a storage element in the output stage of an RMUX,some embodiments place a storage element (e.g., latch or register) in afeedback path between the output and input of the RMUX.

In some embodiments, some or all of the latches or registers areseparate from the RMUXs of the routing fabric and are instead at otherlocations in the routing fabric (e.g., between the wire segmentsconnecting to the outputs and/or inputs of the RMUXs). For instance, insome embodiments, the routing fabric includes a parallel distributedpath for an output of a source routing circuit to a destination circuit.A first path of the parallel distributed path, directly routes theoutput of the source routing circuit to a first input of the destinationcircuit. A second path running in parallel with the first path passesthe output of the source routing circuit through a storage elementbefore reaching a second input of the destination circuit. The storageelement stores the output value of the routing circuit when enabled. Insome embodiments, the second path connects to a different destinationcomponent than the first path. When the routing fabric includes buffers,some of these embodiments utilize these buffers as well to build suchlatches and registers. Several more detailed examples of RCLs and othertypes of storage elements are described in U.S. patent application Ser.No. 11/754,300, filed May 27, 2007, now issued as U.S. Pat. No.7,521,959.

In some embodiments, the configuration/debug network connects to some orall of the UDS elements (e.g., latches, registers, memories, etc.) ofthe configurable IC. In some embodiments, the configuration/debugnetwork has a streaming mode that can direct various circuits in one ormore configurable tiles to stream out their data during the operation ofthe configurable IC. Accordingly, in some embodiments where theconfiguration/debug network connects to some or all of the UDS elements,the configurable/debug network can be used in a streaming mode to streamout data from the UDS elements of the tiles, in order to identify anyerrors in the operation of the IC. In other words, the streaming of thedata from the UDS elements can be used to debug the operation of theconfigurable IC.

In various places in this specification, signals or data are describedas going to the debug network from logic circuits, RMUXs, and/or IMUXs.In some embodiments, such data goes directly from the indicated circuitsto the debug network without any further intervening circuits. In otherembodiments, data can be sent from logic circuits, RMUXs or IMUXsthrough some type of intervening circuit (e.g., a state element). Itwill be clear to one of ordinary skill in the art that references todata going to the debug network from a circuit encompass both data goingdirectly to a debug network, and data going to a debug network throughintervening circuits. For example, where the specification describesdata as going from a logic element to the debug network, in someembodiments data could go from a logic circuit to a state element on theIC, and then from the state element to the debug network. In otherembodiments, the data may go directly from the logic circuit to thedebug network without passing through a state element.

The streaming mode is used in some embodiments to form a logic analyzer,which may be on or off the same IC die that includes the configurabletiles. For instance, some embodiments include a trace buffer on the sameIC die as the configurable tiles. This trace buffer can then be used torecord the data that is output from one or more tiles during thestreaming mode operation of the configurable IC. In other words, thetrace buffer can be used to implement an “on-chip” logic analyzer inconjunction with the streaming mode operation of the IC. An “off-chip”logic analyzer can also be formed by using an off-chip trace buffer(i.e., a buffer that is not on the same die as the configurable IC)while using the streaming mode operation of the IC's configuration/debugnetwork.

Section II provides an overview of the configurable tiles of someembodiments of the invention. Section III provides an overview ofuser-cycles and subcycles. Section IV describes packet data structure.Section V describes IC network structure. Section VI describes someembodiments of a transport network. Section VII describes datastreaming. Section VIII describes debug circuitry. Section IX describessoftware reconstruction of signals in a trace buffer. Section Xdescribes software generation of physical IC configuration. Section XIdescribes tracking data dynamically.

In the discussion above and below, many of the features of someembodiments are described by reference to a network that is used forboth configuration operations and debug operations. One of ordinaryskill in the art will realize that some embodiments might use thisnetwork only for debug operations or only for configuration operations.

II. Overview of Configurable Tiles

FIG. 6 illustrates the configurable circuit architecture of someembodiments of the invention. As shown in FIG. 6, this architecture isformed by numerous configurable conceptual tiles 605 that are arrangedin an array with multiple rows and columns. It should be noted that insome embodiments a “conceptual tile” (or “tile” for short) does notdenote any physically distinct object, but is rather a way of referringto groups of circuitry in a repeated or nearly repeated pattern. In suchembodiments, the lines around individual tiles represent conceptualboundaries, not physical ones.

In FIG. 6, each configurable tile is a configurable logic tile, which,in this example, includes one configurable three-input logic circuit610, three configurable input-select interconnect circuits 615, andeight configurable routing interconnect circuits 620. For eachconfigurable circuit, the configurable IC 600 includes a set of storageelements for storing a set of configuration data. In some embodiments,the logic circuits are look-up tables (LUTs) while the interconnectcircuits are multiplexers. In this specification, many embodiments aredescribed as using multiplexers. It will be clear to one of ordinaryskill in the art that other embodiments can be implemented with inputselection circuits other than multiplexers. Therefore, any use of“multiplexer” in this specification should be taken to also disclose theuse of any other type of input selection circuits.

In FIG. 6, an input-select multiplexer (“IMUX”) is an interconnectcircuit associated with the LUT 610 that is in the same tile as theinput select multiplexer. One such input select multiplexer (1) receivesseveral input signals for its associated LUT, and (2) based on itsconfiguration, passes one of these input signals to its associated LUT.

In FIG. 6, a routing multiplexer (“RMUX”) is an interconnect circuitthat connects other logic and/or interconnect circuits. The interconnectcircuits of some embodiments route signals between logic circuits, toand from I/O circuits, and between other interconnect circuits. Unlikean input select multiplexer of some embodiments (which provides itsoutput to only a single logic circuit, i.e., which has a fan-out of only1), a routing multiplexer of some embodiments is a multiplexer that (1)can provide its output to several logic and/or interconnect circuits(i.e., has a fan-out greater than 1), or (2) can provide its output toother interconnect circuits.

In some embodiments, some or all routing multiplexers can also serve aslatches. For instance, some embodiments use complementary passgate logic(“CPL”) to implement a routing multiplexer. Some of these embodimentsthen implement a routing multiplexer that can act as a latch by placingcross-coupled transistors at the output stage of the routingmultiplexer. Such an approach is further described in U.S. patentapplication Ser. No. 11/081,859, filed Mar. 15, 2005, now issued as U.S.Pat. No. 7,342,415. In the discussion below, routing multiplexers thatcan serve as latches are referred to as routing-circuit latches(“RCLs”).

In the architecture illustrated in FIG. 6, each configurable logic tileincludes one three-input LUT, three input-select multiplexers, and eightrouting multiplexers. Other embodiments, however, might have a differentnumber of LUTs in each tile, different number of inputs for each LUT,different number of input-select multiplexers, and/or different numberof routing multiplexers. Other embodiments might also use differenttypes of logic circuits and/or interconnect circuits. Several sucharchitectures are further described in the U.S. application Ser. No.11/082,193, filed on Mar. 15, 2005, now issued as U.S. Pat. No.7,295,037.

In some embodiments, the examples illustrated in FIG. 6 represent theactual physical architecture of a configurable IC. However, in otherembodiments, the examples presented in FIG. 6 topologically illustratethe architecture of a configurable IC (i.e., they show arrangement oftiles, without specifying a particular position of the circuits). Insome embodiments, the position and orientation of the circuits in theactual physical architecture of a configurable IC is different from theposition and orientation of the circuits in the topological architectureof the configurable IC. Accordingly, in these embodiments, the IC'sphysical architecture appears quite different from its topologicalarchitecture. For example, FIG. 7 a provides one possible physicalarchitecture of the configurable IC 600 illustrated in FIG. 6. In FIG. 7a, sets of four tiles are aligned so that their LUTs are placed closerto each other. The aligned set of four tiles can be conceptually viewedas simply another, though larger, tile 750 itself. In other embodiments,larger numbers of aligned tiles may be conceptually viewed as another,larger tile (e.g., eight aligned tile).

In some embodiments, the tiles may contain multiple aligned logiccircuits per tile, such as two sets of four-aligned LUTs. FIG. 7 billustrates one such alternative tile structure that is used in someembodiments. This tile 700 has two sets 705 of 4-aligned LUTs along withtheir associated IMUXs. It also includes six sets 710 of RMUXs and fivebanks 715 of configuration RAM storage. Each 4-aligned LUT tile sharesone carry chain, one example of which is described in U.S. applicationSer. No. 11/082,193 entitled “Configurable IC with Routing Circuits withOffset Connections”, filed on Mar. 15, 2005, now issued as U.S. Pat. No.7,295,037. The tile structure of the tile 700 of FIG. 7 b for someembodiments is further described in U.S. application Ser. No.11/754,263, filed May 25, 2007, now issued as U.S. Pat. No. 7,535,252.One of ordinary skill in the art would appreciate that otherorganizations for tiles may also be used in conjunction with theinvention and that these organizations might have fewer or additionallogic circuits.

FIGS. 6, 7 a and 7 b illustrate only configurable non-edge logic tiles.The configurable IC of some embodiments includes other types ofconfigurable tiles, such as configurable edge logic tiles (“edge tiles”)and configurable memory tiles. In some of these embodiments,configurable edge tiles are similar to the configurable non-edge logictiles of FIG. 6, except that configurable edge tiles have additionalconfigurable routing circuits for routing input and output data to andfrom the circuits in the configurable tile arrangement illustrated inFIGS. 6, 7 a and 7 b. In some embodiments, a configurable memory tile issimilar to a configurable logic tile except that instead of logiccircuits and associated circuitry (e.g., carry chain circuitry), thememory tile includes memory blocks (e.g., contiguous block of storageelements and associated circuitry). U.S. patent application Ser. No.11/082,193, now U.S. Pat. No. 7,295,037, discloses an example of such amemory tile. This application also described examples of embeddingmemory blocks between tiles. Such memory blocks and neighboring tilescan also be conceptually viewed as a configurable tile or tiles. FIG. 6also omits the circuitry outside of the configurable tiles. Omittedcircuitry may include transport network layers, deskew circuitry,trigger circuitry and trace buffer circuitry.

Many of the figures below represent circuits, components of circuits,and/or connections between circuits and components of circuits. Thoughthese connections are represented in the figures as a single line perconnection, it will be obvious to those of ordinary skill in the artthat any of the connections shown could represent single wires, pairs ofwires, optical connections in an optical logic circuit, or any otherconnection that connects two parts of a logic circuit. For example, asingle connection line could represent a pair of wires used to implementdifferential signaling, with one wire carrying the signal and the othercarrying the inverse of the signal.

III. Overview of User-Cycles and Subcycles

In some embodiments, the LUTs and the multiplexers are subcyclereconfigurable circuit elements, as described in U.S. patent applicationSer. No. 11/082,193, now issued as U.S. Pat. No. 7,295,037. In some ofthese embodiments, the configurable IC is a reconfigurable IC thatstores multiple sets of configuration data for its subcyclereconfigurable circuit elements, so that the reconfigurable circuitelements can use a different set of configuration data in each differentsubcycle. In other words, a subcycle reconfigurable IC has configurationdata that tells it how to reconfigure in every subcycle.

In some embodiments, a configurable IC may operate on a user-cycle basiswith a particular number of subcycles per user cycle. At one level ofabstraction, the configurable IC has a user-design calling for aparticular number of operations to be performed in a particular numberof user-cycles. This user design is translated into a physicalconfiguration with circuit elements that can each perform one operationper subcycle, thus allowing multiple operations per element per usercycle. One advantage of this is that it allows user designs with agreater number of operations per user cycle than the number of physicalelements in the configurable IC.

For example, a user-design may call for four separate logic gatefunctions to be performed by four separate logic gates (in differentlocations on the user-design IC) during a particular user cycle. Thephysical configuration may implement such a user-design by having allfour logic gate functions performed by a single LUT that reconfiguresitself according to stored configuration data in successive user cycles.

In summary, ICs that reconfigure during run time may be referred to as“reconfigurable ICs”. Some reconfigurable ICs are capable ofreconfiguring in each subcycle. These may be called “subcyclereconfigurable ICs”, though they may still be referred to as“reconfigurable ICs” for short.

IV. Packet Data Structure

Some embodiments use a configuration/debug controller to formulateconfiguration/debug packets, which are then routed to the configurabletiles of a configurable IC during configuration/debug operations. FIG. 8illustrates one such controller 815. This controller 815 formulatesconfiguration/debug packets and routes such packets to the configurabletiles 805 over a set of lines 810 that traverse each configurable tilein a tile arrangement 800. The controller formulates configuration/debugpackets at a fast rate in some embodiments. In some embodiments, eachtile 805 in FIG. 8 corresponds to a logic tile (1) with one logiccircuit (such as tile 605 of FIG. 6), (2) with a set of four alignedLUTs (such as tile 750 of FIG. 7 a), (3) with two sets of four alignedLUTs (such as tile 700 of FIG. 7 b). In some embodiments, some or alltiles 805 are some other type of tile (e.g., edge tiles, memory tiles,etc.).

In some embodiments, the set of lines 810 includes eighteen lines, sixof which are used to provide control signals, and twelve are used toprovide data signals. The six control signals serve as an opcode(operation code), while the twelve signals serve as the operand (i.e.,data argument) associated with the opcode. Accordingly, the six linesare referred to below as the opcode lines while the twelve lines arereferred to as the operand lines.

As mentioned above, some embodiments use a packet switching technologyto route data to and from the resources in the configurable tiles.Hence, over the eighteen lines that traverse through each set of tiles,these embodiments can route variable length data packets to configurabletiles sequentially, randomly, or based on tile types (including a globaltile type).

V. Ic Network Structure

Some prior art integrated circuits implemented debugging operationsusing invasive debug designs. An invasive debug design is one whichrequires that the user design be changed in order to take the debuggingoperations into account. For example, configurable circuits that wouldotherwise be used for implementing functions of the user design wouldinstead be used for debugging operations. Using an invasive debug designcan lead to the physical implementation being spread out over a largerarea on the chip. Such a spread out design can cause the physicalimplementation to be sub-optimal. An invasive design can also requirethat the physical implementation of the user design be restructured inorder to receive data from various different parts of the physicalcircuit, thus costing time and effort to place and route the elements ofthe circuit multiple times.

In some embodiments or the present invention, the debug network isnon-invasive. A non-invasive debug network is one which does not need touse circuits that would otherwise be used to implement the user'sdesign. Some advantages of a non-invasive debug network of someembodiments are that the non-invasive debug network; 1) has theadvantage of not requiring a spread out implementation of the userdesign, 2) doesn't require restructuring the physical implementation ofthe user design in order to retrieve data from different parts of thecircuit.

Non-invasive debug networks aren't allowed to use circuits that areassigned to implementing the user design, but the non-invasive debugnetworks of some embodiments are allowed to use “leftover” circuits, forexample, configurable interconnect circuits. Therefore, once a userdesign circuit has been implemented on the configurable IC, suchconfigurable circuit elements of the configurable IC that are not usedto implement the user design circuit may be put to use to support thedebug network and transport network.

FIG. 9 provides an overview of the configuration and debug network 900of some embodiments. As shown in this figure, this network includes aconfiguration/debug bus 905 and a configuration/debug controller 815.The configuration/debug bus 905 passes through each tile of a tile array910, so that the configuration/debug controller 815 can routeconfiguration/debug packets to the tiles of the tile array 910. Debugdata passes out of the bottom tiles and into the transport network. Insome embodiments, the transport network layers 950 are implemented aspartial crossbars, in other embodiments, other types of circuits may beused for routing data. Instances where both partial crossbars andtransport network layers are mentioned do not indicate that instanceswhere one or the other are mentioned are limited to the one mentioned.The debugging circuitry of the configurable IC includes trace buffer960, deskew circuitry 970, and trigger circuitry 980.

As shown in FIG. 9, the tile array includes four types of tiles, whichare: top, edge, central, and bottom. Central and edge tiles have asimilar circuit structure in the configuration/debug network 900, exceptthat edge tiles store more configuration bits as they control theconfigurable I/Os of the configurable IC and may contain differentprogrammable resources (e.g., the east/west tiles might contain LUTs,while the north/south tiles might not).

The top tiles have a network circuit structure that allows packets topass along the top tile row. The top tiles also include the columnselection functionality that can route a particular packet down aparticular column that is addressed. This column selection functionalityroutes tile X and tile Y frames down each column as well. The tile Xframe is routed down each column as it serves as (1) a column enablesignal for each column that contains an addressed tile, and (2) a columndisable signal for each column that contained a previously addressedtile. In the configuration/debug network 900, the tile Y frame also getsrouted down each column before the column select circuitry of theparticular column can determine that the particular column does notcontain the destination (i.e., addressed) tile for the current packet.The network circuit structure of each tile also includes a tileselection circuit that allows a tile to detect that a packet isaddressed to it.

The configuration/debug network exits the bottom tiles and enters thetransport network. In some embodiments, the transport network of FIG. 9includes a set of transport network layers 950. The transport networklayers 950 route the debug data along data buses 952, 954 and 956 to thetrace buffer 960 and the deskew circuits 970. The deskew circuits 970pass the deskewed data to the trigger circuits 980.

In some embodiments, data sent from the configurable circuits via theconfiguration/debug network is passed to each transport network layer.In such embodiments, each transport network layer 950 has the sameincoming data. The configuration of the circuits in each transportnetwork layer determines which bits of that data will be passed along bythat layer. In some embodiments, the configuration of circuits in eachtransport layer may also determine when to pass along the received data.Note that in some embodiments, the number of transport network layersmay be higher or lower than the number shown in FIG. 9. As mentionedabove, some embodiments may use different types of transport networks.In some embodiments, the transport networks have multiple layers (suchnetworks may be called “multi-layer transport networks”), with eachlayer capable of receiving and passing along data from the tile array.In some such embodiments (described elsewhere in this specification),one or more of these layers may send data to a trigger circuit thattriggers a trace buffer to stop recording new data.

In FIG. 9, and in many other figures of this specification, data linesare represented with a slash through them and the letter “n” next to theslash. These symbols indicate that the line represents multiple datalines, but is represented as one line rather than render the figuredifficult to understand by having a separate line for each bit of widthof the line. In some figures, the number of bits wide of a particulardata bus is provided in the text. However, it will be clear to those ofordinary skill in the art that: 1) other values of n can be used inother embodiments, and 2) multiple instances of “slash n” in aparticular figure do not necessarily represent the same width as eachother even within that particular figure. For instance, in someembodiments illustrated by FIG. 9, data buses 952, 954 and 956 do havethe same widths (n bits wide) as the configuration/debug bus 905. Otherembodiments may use different widths of data buses 952, 954 and 956. Insome embodiments, the widths of the data buses are the same as eachother but different from the widths described here, in other embodimentsthe widths of the data buses may be different from each other.Furthermore, when the text or context indicates that a line without a“slash n” is a multiple line bus, the absence of the “slash n” shouldnot be taken to mean that a line is a single bit data line.

The configuration/debug network 900 has a known latency through each ofthe tiles. Two implications of this known latency in each tile arethat: 1) two signals that pass through different numbers of tiles maytake different amounts of time to arrive at the transport network; and2) the amount of time it takes for a signal to pass through a set oftiles can be predicted from the path through the tiles. Morespecifically, the amount of time necessary for a read message to getfrom the controller 815, to the intended tile, and for the debug datafrom that tile to reach the transport network layers 950 depends on thelocation of the tile in the array.

This raises the issue of how to compare data that comes from differentparts of the configurable IC. The deskew circuitry 970 compensates forthe variance in delays caused by bits arriving from different physicallocations. In some embodiments, the deskew network also compensates forother delays. Other delays may include those incurred in compensatingfor congestion of the configuration/debug and transport networks andthose caused by retiming of the configured circuit. For example whenimplanting a user design with elements on different subcycles (seesection III, above for details on subcycles). The deskewing allows thetrigger 980 to operate on data that is adjusted to appear properlysimultaneous. The deskew circuitry is explained in more detail below.

The configuration/debug network 900 includes resources that are not partof the routing fabric of the tiles and are not usable as part of therouting fabric of the tiles. An example of such resources is theconfiguration/debug bus 905. In some embodiments, theconfiguration/debug bus 905 has a fixed width in each column. The amountof data that the configuration/debug bus 905 can carry to the transportnetwork is limited by this width. In some circumstances, it is desirableto collect more data bits from a given column than the width of theconfiguration/debug bus in that column would allow. In some embodiments,this problem is solved by using the routing fabric of the tiles to sendthe additional data bits to tiles in one or more other columns. In otherwords, if the demand from a particular column is higher than thecapacity of the configuration/debug network in that column, then therouting fabric can redirect the signal to another column with excesscapacity in the configuration/debug network. Examples of routing fabric,such as wiring and interconnects that connect the configurable logiccircuits are disclosed in U.S. patent application Ser. No. 11/082,193,now issued as U.S. Pat. No. 7,295,037. More detail on using the routingfabric to supplement the configuration/debug network will be describedbelow in reference to FIGS. 34 and 35 a-35 b.

In this specification, the figures show the data flowing “down” theconfiguration/debug network, then along the transport network from leftto right, then into a trace buffer to the right of the transport networkand into a trigger above the transport network. However, it will beclear to one of ordinary skill in the art that other orientations ofcomponents other than the particular orientations illustrated arepossible within the scope of the invention. For example, theconfiguration/debug network might send data “up” to a transport networkabove the tile array, or data might flow from right to left to reachtriggers or trace buffers on the left instead of the right, etc.

VI. Transport Network

The configuration/debug network of some embodiments passes out of themain tile array and enters into the transport network layers 950 of thetransport network. FIG. 10 illustrates the partial crossbars used insome embodiments to implement transport network layers 950. Data entersthe partial crossbar 1000 on data lines 1010. In some embodiments, thereare twelve data lines 1010 per column. FIG. 10 illustrates inputs fromtwo columns; some embodiments accept inputs from more columns, such asthe number of columns in the tile array. The data lines 1010 entermultiplexers 1020. Each multiplexer 1020 can be set, during debuggingoperations, to pass on data from the column above it, or from theimmediately previous section of the partial crossbar. In this and inother figures, multiplexers in the transport network may be shown ashaving inputs coming in from the left of the multiplexers, however itwill be clear to one of ordinary skill in the art that in some figures,the transport network may have data flow from right to left instead, andin such embodiments the inputs would come in from the right. In anycase, it will be clear to one of ordinary skill in the art that in someembodiments the first column in the chain (whichever side it is on),having no preceding column, does not receive inputs from a precedingcolumn.

The multiplexers 1020 can be set in tandem or individually. In eithercase, the data is passed on to state holding elements 1030 (e.g.,buffers), between the multiplexers associated with one column and thenext. In FIG. 10, each data line 1010 enters a single 2-to-1 multiplexer1020; however other embodiments may add flexibility by splitting eachdata line 1010 into multiple lines and having each line provide input tomultiple multiplexers. For example, FIG. 13, described in more detailbelow, illustrates an embodiment in which each data line connects to one2-to-1 multiplexer in each of three partial crossbars 1350. This allowsany data line to send data to the trace buffer 960 through any of thepartial crossbars 1350. Other embodiments may split the data lines threeways, and have each data line connect to three separate 4-to-1multiplexers. The 4-to-1 multiplexers, in turn, would each get inputfrom 3 separate data lines, and one input from the immediately previoussection of the partial crossbar. The multiplexers could then be set topass on data from any of these inputs. Still other embodiments maycombine these concepts and have data lines which connect to multiplemultiplexers in each of multiple partial crossbars. Some embodimentsallow reconfiguring of the transport network dynamically. This allowsthe user to determine at any time what circuit elements should bemonitored by the debug system.

Data passes from different columns of the tile array to correspondingparts of the transport network. The transport network as shown in FIG.10 passes data along the transport network from the column on which itarrives to the end of the transport network. This passing on of data canlead to congestion when data coming in from above arrives at amultiplexer in a subcycle when the multiplexer is busy with data passedto it from the previous multiplexers in the transport network.

In some embodiments, the transport network uses multiplexers with largernumbers of inputs and other components outside the multiplexer to handlecongestion. FIG. 11 illustrates a multiplexer 1130 of some embodimentsalong with some surrounding components. The multiplexer 1130 has fourinputs, 1130 a-1130 d. Input 1130 a comes directly from theconfiguration/debug network. Input 1130 d comes from the multiplexer tothe left (not shown). Inputs 1130 b and 1130 c come from the outputs ofstorage elements 1110 and 1120 respectively. Storage elements 1110 and1120 take inputs from the configuration/debug network. The storageelements of some embodiments either “hold” the value of a previouslyreceived input, or pass the value of the input as it comes in. A “held”value is available at the output of the storage element until thestorage element is switched back to pass. In some embodiments, switchingfrom pass to hold (or vice versa) is commanded by a signal on a controlline (not shown). In other embodiments, the storage element can bepre-programmed to switch in a given subcycle.

For this specification, combinations of circuit elements such as the oneillustrated in FIG. 11 will be called “delay select multiplexers”. The“delay select multiplexers” of some embodiments have multiple inputsthat receive data on multiple data lines. The multiple data lines branchfrom a single data line, with at least some of the data lines having astorage element or other configurable delaying circuit element after thebranch but before the input. Such delay select multiplexers can be usedin place of the two input multiplexers described in relation to thepartial crossbars of FIGS. 10 and 13. In some embodiments, the delayselect multiplexers are provided in a plurality of chains of delayselect multiplexers.

The storage elements can be used to delay signals that come in from thetile array at a congested subcycle until a free subcycle is available.Data passes through the transport network at pre-established rates.Conceptually, network capacity can be divided in to discrete slots; eachslot can either be empty or contain a single bit of data. The more slotsthat are occupied during a given subcycle at a particular part of thenetwork, the fewer slots are available and the more congested thenetwork is. An example of an occupied slot is one in which a signal fromthe left is coming in on input 1130 d (the slot contains a bit). Anotherexample is a slot in which a signal from a column to the right of theshown element will be arriving when the slot reaches that point in thenetwork (e.g., the slot is reserved for data from further along thetransport network). In either case, the slot is not available forsignals coming down from the configuration/debug network.

As an example of using delays for slotting purposes, consider a casewhere two data bits, if neither of them were delayed, would “try” toreach the trace buffer on the same line and in the same subcycle. Inthis case, assume that the first data bit is coming in from column threeof a tile array, on the configuration/debug network. If it is notdelayed in reaching a multiplexer 1130, it will reach the trace bufferon line one and in subcycle two. Now suppose the second data bit, comingfrom another column is already on course to arrive at the trace bufferon line one and in subcycle two. The storage element 1110 can hold thefirst data bit for a later subcycle. Next, suppose the trace buffer hasa free slot on line one in subcycle five. If the data bit reaches themultiplexer 1130 in a particular later subcycle, the first data bit willreach the trace buffer on line one and in subcycle five. When thatparticular later subcycle arrives, the multiplexer 1130 switches toinput 1130 b, allowing the first data bit to proceed to the tracebuffer. The first data bit reaches the trace buffer on line one and insubcycle five. The second data bit reaches the trace buffer on line onein subcycle two. Thus, the delay select multiplexer averts the potentialconflict between the arrival times of the first and second data bits.

In some embodiments, such as the one illustrated in FIG. 9, the linesfrom the direct and delayed connections from the configuration/debugnetwork branch, and part of the branches go down to a second layer ofthe transport network, and can even branch again there, one set of threeconnections going into three out of four inputs of a multiplexer and theother set of three connections going down to a third layer of thetransport network. In embodiments with greater numbers of transportnetwork layers, such splitting can be repeated for as many layers asdesired. The result of these multiple inputs, and storage elements, andtransport network layers is that there is great flexibility in whatsubcycle and on what connection a bit of debug data reaches the tracebuffer. In some embodiments, only one layer has such storage elements,in other embodiments, each layer has its own set of storage elements. Insome embodiments, at least some of these storage elements are latches.

VII. Streaming

In some embodiments, all elements of the configurable IC are availableon the configuration/debug network 900. Examples of such elementsinclude UDS elements (such as RCLs and other storage elements in therouting fabric, memory cells, register cells, etc.), LUTs, and/or othercircuit elements that connect to the configuration/debug network. As theelements are accessible through the configuration/debug network, thisnetwork can be used to access (read from or write to) the elements inany sequential or random access manner. Random access in this contextmeans that the elements can be accessed through the configuration/debugnetwork and the data packets as desired by a user or debugger, ratherthan in a particular set sequence.

Moreover, as the elements are accessible through the configuration/debugnetwork, this network can read out the state (e.g., the value of UDSelements) of the configurable IC while the IC is operating. This abilityis highly advantageous for performing debugging during the operation ofthe configurable IC.

In some embodiments, the configuration/debug network has a streamingmode that can direct various elements in one or more configurable tilesto stream out their data during the user-design operation of theconfigurable IC at the user design operating frequency or faster. Thisstreaming data makes the debugging abilities of the configurable IC evenmore robust as it allows a large amount of computed and configurationdata to be simultaneously captured while the user design circuitimplemented on the configurable IC operates at high speed.

The streamed data can be passed through to the trace buffer 960 (as seenin FIG. 9). The trace buffer 960 stores data as it comes in, deleting oroverwriting the oldest data as new data enters. When the trigger 980detects that pre-determined conditions have been met, it signals thetrace buffer 960 to stop taking in new data and stop deleting oroverwriting the oldest data. Further detail on the trace buffer may befound in section VIII below.

FIG. 12 illustrates a process 1200 that the configuration controller 815can perform to operate the configuration/debug network in a streamingmode. As shown in this figure, the streaming process 1200 initiallyaddresses (at 1205) a set of tiles. The process can address such a setby sending a tile X frame and a tile Y frame that identify one tile.Alternatively, the process can address a set of two or more tiles bysending a tile X frame that specifies a global type (in order to enablethe column selection circuit of each column) followed by a tile Y framethat specifies the tile type or tile address that identify the tile ortiles being addressed.

Next, the process 1200 sets (at 1210) the mask and merge bits in themask and merge registers of mask and merge logics of the set of tilesaddressed at 1205. In some embodiments, multiple elements send data tothe debug network at the same time. Such embodiments may have mask andmerge registers to filter out data from elements that are not beingmonitored. Mask and merge registers are described in more detail in U.S.patent application Ser. No. 11/375,562, now issued as U.S. Pat. No.7,788,478, incorporated herein by reference. Accordingly, the maskand/or merge registers of some embodiments mask out the values that areread from the elements of the addressed set of tiles when this set doesnot include any element whose value has to be streamed out during thestreaming operation. Alternatively, when the addressed set of tilesincludes a particular set of user-design states that needs to bestreamed out, the mask and/or merge registers do not mask out the valuesthat are read from the UDS elements that need to be streamed out.

Various embodiments provide various types of readable elements. Readableelements are UDS elements in some embodiments. In other embodiments,readable elements include UDS elements as well as other storage and/orcircuit elements. In still other embodiments, readable elements do notinclude UDS elements, but do include other storage and/or circuitelements. In some embodiments, the readable elements of a tile aregrouped together into “readable buckets” for purposes of sending data(e.g., UDS data) to the configuration/debug network. For example, ifthere are thirty readable elements and the configuration/debug networkcan handle at most ten elements from a tile at a time, then the readableelements can be grouped into three readable buckets of ten elementseach. When one of the thirty elements is to be read, its readable bucketis selected, and all elements in that readable bucket try to send theirsignals to the configuration/debug network. In some embodiments, thereadable buckets are further divided into “nibbles”. Each nibblerepresents some fraction of the total number of readable elements (e.g.,one third). In some of such embodiments, at most one tile has access toa particular nibble during a given subcycle. In such embodiments, datafrom elements in a second tile, but in the same nibble, cannot be sentdown the debug network during that subcycle.

In order to select a readable bucket, the process, at 1215, sends areadable bucket address to the tiles (e.g., the set of tiles addressedat 1205). The mask and merge registers described above allow the desiredsignals from the elements in the selected readable bucket to pass to theconfiguration/debug network while screening out the unwanted signals.

After 1215, the process determines (at 1220) whether it needs to set themask and merge register values in any other set of tiles. If so, theprocess returns to 1205, which was described above. Otherwise, theprocess notifies (at 1225) all tiles that the subsequent set of readoperations are directed to them. In some embodiments, the process sonotifies the tiles by sending a tile X frame that specifies a globaltype (in order to enable the column selection circuit of each column)followed by a tile Y frame that specifies the global tile type. At 1225,the process also starts the user-design operation of the IC. In someembodiments, the user-design operation of the IC might have startedbefore the process 1200 of FIG. 12 started. In other words, someembodiments allow tiles to be configured or reconfigured for streamingafter the user-design operation of the IC has started.

At 1230, a Read frame is sent, which causes all tiles to read data(e.g., UDS data) at the readable bucket addresses that were set at 1215.This read out data is initially stored in the operand field of the Readframe. As mentioned above, while transmitting this data, the tiles maskand merge logic circuits eliminate the data bits that are supposed to bemasked out from the data stream that is streamed out of the tilearrangement. As further described below, the data stream can stream intoa trace buffer that is outside of the tile arrangement but on the sameIC die. In some embodiments, the merge register can be set per each bitfor each subcycle to allow the merging operation to be defined per bitper each subcycle, while the mask register can be set per each subcycleto allow the masking operation to be defined per each subcycle. In someembodiments, mask and merge operations both occur within theconfigurable tiles. In other embodiments, one or both of the operationsmay be done at the transport network. For example, in some embodiments,the mask operation essentially occurs in the tile (e.g., the logic tile,the memory tile, etc.), while the merge operation is done in thetransport network.

After 1230, the process determines (at 1235) whether it needs tocontinue the streaming mode by sending another Read frame in the nextcycle. If so, another Read frame is sent at 1230. In some embodiments,the process 1200 sends Read frames through the configuration network atsuch a rate to ensure that UDS (or other) data streams out of the IC atthe user-design operational rate or faster, e.g., at the subcycle ratein case of a subcycle using IC. For instance, in some embodiments, theconfigurable IC physically operates at 800 MHz to implement a 200 MHzuser design with circuits that each loop through four configuration datasets in each user design cycle, changing to perform up to four differentoperations in the four subcycles associated with each user design cycle.In such an embodiment, the process 1200 could send Read frames throughthe configuration/debug network at a rate of 800 MHz to stream out data(e.g., UDS data) values at a rate of 800 MHz. In this manner, themonitored element's values could be streamed out for the four subcyclesin each user design cycle, which thereby provide the monitored valuesfor each user design cycle. The Read frames are repeatedly sent outuntil a determination is made (at 1235) that the streaming mode shouldterminate. At this stage, the streaming process ends.

VIII. Debug Circuitry

A. Trace Buffer

The streaming operation of the configuration/debug network 900 can beused to create a logic analyzer functionality on the configurable IC. Insome embodiments, a logic analyzer has three components: (1) a samplingcomponent, (2) a capture component, and (3) a trigger component,including deskew circuits. The streaming operation can serve as thesampling component of a logic analyzer. It can continuously providesamples of certain states of the configurable IC during the IC'soperation.

An on-chip trace buffer can perform the capture component of the logicanalyzer. FIG. 13 illustrates an example of an IC with such a tracebuffer 960. The trace buffer 960 is on the same configurable IC die 1300as the tile array 910 and configuration controller 815. This bufferreceives the sets of connections 952, 954, and 956 of the transportnetwork layers 950 of the transport network. As mentioned above, theconnections 952, 954, and 956 in some embodiments are (together)thirty-six bits wide, which allows the trace buffer to receivethirty-six bits of streamed-out data (e.g., UDS data) from the tilearrangement 910 on each clock cycle. In embodiments where the tilearrangement is part of a subcycle reconfigurable IC, the trace buffercan receive thirty-six bits on each subcycle of the user design cycle.

In this example, the trace buffer has 36 one-bit inputs. Thus, to storethe bits coming in on each line, the trace buffer must be at least36-bits wide. The trace buffer is some number of bits long. Generally,the longer the trace buffer is (in bits) the more IC area the tracebuffer occupies. For this example, the trace buffer is 128 bits long.Thus, the trace buffer of this example can be represented by a grid ofslots 36 bits wide by 128 bits long. Data can be written on one “row” ofthis grid in each subcycle. In some embodiments, there are eightsubcycles per user cycle. In such embodiments, a 128 bit long bufferwould store data for 16 user cycles (128/8).

Getting data (e.g., UDS data) from a particular element (e.g. UDSstorage element) usually means getting data from the same element forseveral user cycles running. This means that in embodiments with eightsubcycles per user cycle, data from that element may be written to thesame “column” of the trace buffer, in one row of every eight. Thus, fora given input connection, data written on a given subcycle of each usercycle may repeat every eight slots. In this specification, the set ofslots written by a given input and in a given subcycle can be called a“slot set”. An “open slot set” is one in which no data is assigned tothe slot set for the given subcycle and input connection.

In some embodiments, the trace buffer 960 is a circular buffer thatcontinuously stores the data that it receives until instructedotherwise. When a circular trace buffer runs out of rows, it startsrewriting the rows, overwriting the oldest rows first. This goes onuntil the trigger signals a stop, at which point the trace buffer stopsoverwriting. The trace buffer then waits to offload the data from theconfigurable IC to the debug software. In some embodiments, the tracebuffer has extra width to accommodate bits to keep track of the subcyclein which the data arrived and/or to keep track of which row is beingwritten. In other embodiments, tracking data is maintained separatelyfrom the circular memory of the trace buffer, either within othercircuitry that is part of the trace buffer or elsewhere.

B. Trigger

The trigger component of the logic analyzer is performed by a triggercircuit 1315 that communicates with the trace buffer 960. This triggercircuit 1315 analyzes the data (e.g., UDS data) as it is being stored inthe trace buffer. When the trigger circuit 1315 identifies a particularset of values or sequence of values coming in on connections 1358, thetrigger circuit directs the trace buffer to stop accepting new data thatis being streamed out of the tile arrangement 910. In some embodiments,the trigger can be set to allow some delay (sometimes called a“programmable delay”) between the trigger event and the stopping of thebuffer. Such a trigger delay allows data to be collected from beyond thetime of the trigger event itself. In this manner, the trace buffer maystore a relevant subset of data that it received for a certain timeinterval before and/or after it stored the trigger-event data that thetrigger circuit detected. In some embodiments, the programmable delaycan optionally be set to delay for: 1) half the depth of the tracebuffer, so that approximately the same amount of data will be bufferedbefore the trigger event as after, 2) the depth of the trace buffer, sothat most or all of the collected data will be from after the trigger,or 3) short or no delay, so that most or all of the data in the tracebuffer is from before the trigger event. After stopping the tracebuffer's recording, the trigger circuit in some embodiments directs theconfiguration controller to stop the streaming mode operation of thetile arrangement (e.g., to stop sending Read frames).

In some debugging operations, the trigger-event is a comparison betweentwo user signal variables. In some cases, the tiles corresponding to theindividual bits of data (e.g., UDS data) of each user signal variableare in different physical locations on the IC. The different physicallocations of the tiles lead in turn to the data taking different amountsof time to reach the trigger circuitry. If a trigger compares datasimultaneously with its arrival, but the data is coming in withdifferent timing, the trigger will not be comparing the correct instanceof the variables with each other. In order to align the variables intime, some embodiments interpose deskew circuitry 1320 between thetransport network and the trigger circuitry.

C. Deskew Circuits

FIG. 14 illustrates two sets of bits (8-bits in each set) coming in withdifferent timings.

The bits of the first set, “A”, come in, one per user cycle, with adelay of twelve subcycles relative to when each bit was generated in thetile array. The bits of the second set, “B”, come in, one per usercycle, with a delay of three subcycles relative to when each bit wasgenerated in the tile array. The deskew circuits of some embodimentstemporally align the data, providing it to the trigger in the order itwas generated so that simultaneously generated signals reach the triggercircuits at the same time.

Box 1410 represents the data as it comes in to the deskew circuitry. Thetop line of the box represents the number of the user cycle that thebits come in on. The second line represents the number of the subcyclethat the bits come in on. Box 1420 represents the intended temporalalignment of the data at the trigger circuitry. The outputs of thedeskew circuitry go to the trigger circuitry 970 (not shown). If theoutput is to have the same temporal alignment as the original signalsgenerated in the tile array, the operation of the deskew circuitryshould produce output matching the output seen in box 1420. In someembodiments illustrated by FIG. 14, the trigger circuitry evaluates thebit sets as of the end of each user cycle, but for ease of reading, thebits in box 1420 are centered. In other embodiments, the trigger mayevaluate the bit sets as soon as the subcycle of the later bit set. Theprocess of some embodiments of deskewing two sets of bits in accord withFIG. 14 is illustrated in FIGS. 16-19.

The deskew circuitry of some embodiments is shown in FIG. 15. The deskewcircuitry 1500, includes data entry lines 1510 and 1512, space-time loadcontrols 1520 and 1522, one-bit wide shift registers 1530 and 1532,four-to-one MUXs 1540 and 1542 with inputs from the individualbit-registers 1530 a-1530 d and 1532 a-1532 d, latency controls 1550 and1552, and outputs 1560 and 1562 from the deskew circuitry to the triggercircuitry. For clarity, and to show individual elements of the deskewcircuitry of some embodiments, circuits for deskewing two bits are shownin FIGS. 15-19. Some embodiments may deskew larger numbers of bits, forexample 12, 48, 50, 72, or 96, or any other number. FIGS. 15-19 showenough circuitry to deskew two bits, the process of which will be shownin FIGS. 16-19. Deskewing temporally aligns bits with each other, whichcan only be done if there are at least two bits to align. It should benoted however, that in some embodiments, there may be deskew circuitrywhich places no delay on the last bit to come in. Such embodiments couldpass the last bit directly to the trigger circuitry 970, havingpreviously delayed most or all other bits using deskew circuitry. Inother embodiments, all bits coming in to the deskew circuitry passthrough deskew circuitry. In some such embodiments every bit is delayedby at least one subcycle before reaching the trigger.

The following descriptions of the operation of shift register 1530 alsoapply to shift register 1532. In FIG. 15, shift register 1530 operatesby successively loading one bit at a time into bit-register 1530 a. Aseach new bit is loaded, the previously loaded bits are shifted to theright. Over successive user cycles, the data bits are shifted from 1530a through 1530 d. Shifting previous bits over as each bit comes in isthe way a typical shift register works, but the time or circumstance inwhich new bits come in is configurable in some embodiments. In someembodiments, a bit is loaded into bit-register 1530 a when space-timeload control 1520 prompts the register to receive it. Space-time loadcontrol 1520 prompts the shift register 1530 to receive a bit on oneparticular subcycle per user cycle. Therefore, in such embodiments, theshift registers 1530 and 1532 shift once per user cycle. The receivedbit goes into bit-register 1530 a, the bit that had been in bit-register1530 a shifts to bit-register 1530 b and so on until the bit in the lastbit-register is simply overwritten, not shifting anywhere. In otherembodiments, the space-time load control 1520 may skip loading on someuser cycles. For example, if for some reason a particular set of datavalues only needed to be monitored every other user cycle, a space-timeload control could activate in some subcycle every other user cycle.

The latency control 1550 determines which input of MUX 1540 is active.Thus, the latency control 1550 determines how many user cycles to delay.As described above, the space-time load control 1520 of some embodimentsactivates the shift register 1530 once per user cycle. Because the shiftregister 1530 shifts once per user cycle, a data bit reaches each inputof the multiplexer 1540 one full user cycle after the previous input.For example, it takes three user cycles after a bit is loaded intobit-register 1530 a for the bit to reach bit-register 1530 d. Therefore,if the MUX 1540 is told by latency control 1550 to choose the input thatcomes from bit register 1530 d, the bit will be seen by the active inputof MUX 1540 only after a delay of three user cycles from when it wasloaded into bit-register 1530 a.

The shift register 1530 and the multiplexer 1540 determine how many fulluser cycles to delay a data bit, and the space-time load control 1520determines which of the multiple possible subcycles within each usercycle will provide the data bits that go into the shift register 1530.Therefore, by selecting appropriate values for the space-time loadcontrols 1520 and 1522 and the latency controls 1550 and 1552, thedeskew circuits can cause delays of an arbitrary number of subcycleswithin a certain range.

The range is from one to the product of the length of the bit shiftertimes the number of subcycles per user cycle. In FIG. 15, the shiftregisters 1530 and 1532 are four bits long, and as shown in FIG. 14there are four subcycles per user cycle. Thus, the range for theseexamples is from one to sixteen subcycles. Other embodiments may uselonger or shorter shift registers (e.g., more or fewer bit-registerswide), to delay by more or fewer full user cycles (respectively). Otherembodiments may also use more or fewer subcycles per user cycle, makingeach user cycle worth of delay mean a larger number of subcycles delay.It should also be noted that while the above descriptions say “shiftregisters” any other type of stepwise delay circuit could be used inalternate embodiments.

In the following example, in accord with the delays indicated in FIG.14, the space-time load control 1520 prompts shift register 1530 to loadbits into bit-register 1530 a in subcycle zero and space-time loadcontrol 1522 prompts shift register 1532 to load bits into bit-register1532 a in subcycle three. FIGS. 16-19 show the result of data loadingover several user cycles, given the data pattern shown in FIG. 14. Aconvention in computers and electronics is to start numbering from zeroand going up to N−1, where N is the total number of items to be counted.For purposes of keeping the verbal descriptions of the subcycles in linewith these conventions, the subcycles described below will becharacterized as the zeroth, first, second, and third, rather than thefirst through fourth. For clarity, the individual bit-registers in FIGS.16-19 are not numbered, but are shown as containing particular bits.

FIG. 16 shows the state of the deskew circuitry as of the third subcycleof the zeroth user cycle. The first bit, B₀, of bit set B has beenloaded into the shift register 1530 at bit register 1530 a. The datainput line 1610, represented in FIGS. 16-19 as thicker than the otherdata lines, represents the data line to the active input of MUX 1540.The data input line 1612, represented in FIGS. 16-19 as thicker than theother data lines, represents the data line to the active input of MUX1542. As shown in the figure, the first bit, B₀, has not yet reached thebit register connected to data input line 1610. The first bit of bit setA has not reached the deskew circuitry and thus has not been loaded intoshift register 1532. Therefore, the first bits of bit sets B and A havenot yet been passed on to the trigger circuitry. FIG. 17 shows the stateof the deskew circuitry as of the third subcycle of the first usercycle. The first two bits, B_(o) and B₁, have been loaded into shiftregister 1530, but neither of them is on the bit register connected tothe active input of MUX 1540. FIG. 18 jumps ahead to the zeroth subcycleof the third user cycle. At this point, the first three bits of bit setB have been loaded into shift register 1530 and the first bit, A₀, ofbit set A, has been loaded into bit-register 1532 a. The active input ofMUX 1542 is the input connected to bit register 1532 a. Thus, the firstbit of bit set A is passed through MUX 1542, and is available to thetrigger circuitry. FIG. 19 illustrates the state of the system as of thethird subcycle of the third user cycle. At this time, the first bit ofbit set B has reached the bit register corresponding to the active inputof MUX 1540. Thus, as of this time, the end of the third user cycle, thefirst bits of each bit set are simultaneously available to the triggercircuitry. During each subsequent user cycle, the subsequent bits of thebit sets are presented to the trigger circuitry: A₁ and B₁, as of theend of the fourth user cycle; A₂ and B₂, as of the end of the fifth usercycle, and so on. Thus, the deskew circuitry undoes the effects of thedifferent time delays of the variables caused by the physical positionsof their respective tiles. FIG. 20 illustrates the incoming data as seenby the trigger circuitry. Note that this is the same box 1420 as thedesired presentation of the data as seen in FIG. 14.

D. Multi-bit Deskew Circuits

In some embodiments, the deskew circuits have more flexibility in whichoutput wires from the transport network layers go into which deskewcircuits. In such embodiments, rather than there being a single one-bitconnection feeding each 1-bit deskew, each 1-bit deskew is preceded by amultiplexer fed by all the wires from the first transport network layer.FIG. 21 illustrates two such deskew circuits of some embodiments. In thefigure, 1-bit deskew circuit 2110 receives its input from multiplexer2115, 1-bit deskew circuit 2120 receives its inputs from multiplexer2125. Multiplexer 2115 receives its inputs from twelve 1-bit connections2131. Multiplexer 2125 receives its inputs from twelve 1-bit connections2132. 1-bit connections 2131 and 2132 split off from twelve 1-bitconnections 2130. The 1-bit connections 2130 split off from the 12-bitconnection 2135. This split is representational, as the 12-bitconnection 2135, shown with the diagonal bar, is a conventional andcompact way of representing multiple 1-bit connections. In this figure,the barred lines represent twelve connections. The circuits illustratedin FIG. 21 permit each of the 1-bit deskew circuits 2110 and 2120 toreceive their individual bits from any of the twelve connections comingfrom the top transport network layer (not shown). In simpler terms, themultiplexer picks which input to pay attention to, the rest are ignored.

In some embodiments, each 1-bit connection coming into the deskewcircuits carries one data bit at a time. Here, “at a time” means “withina given clock cycle”. In embodiments that operate on a subcycle basis “agiven clock cycle” means “a given subcycle”. With one bit coming in persubcycle on each 1-bit connection, each 1-bit connection can bring in asmany data bits during a given user cycle as there are subcycles in thatuser cycle. The potential number of data bits coming into the deskewcircuits on one user cycle for an embodiment with X subcycles per usercycle and Y connections is X*Y, the mathematical multiplication of X andY. The deskew circuits can receive and deskew one of these data bits per1-bit deskew circuit. The multiplexer at the input selects a connection,and the space-time load control selects a subcycle in which to loaddata. For example, an embodiment with six connections and eightsubcycles per user cycle could have eight data bits (one per subcycle)coming in on each of the six connections, for a total of forty-eightdata bits coming in per user cycle.

Any given multi-input deskew circuit can ignore most of the data signalsreaching it. Of the signals reaching it, the input multiplexer of agiven multi-input deskew circuit may “focus” on one selected connection,and the 1-bit deskew circuit may narrow the “focus” to signals coming induring one selected subcycle (in each user cycle). In embodiments withfewer that X*Y multi-bit deskew circuits, the deskew circuits may not beable to simultaneously deskew all the signals coming in on all thelines. The following are some examples of configurations that selectsubsets of the entire set of signals. One example of a configuration forusing a system with twelve multi-bit deskew circuits would be to haveeach multi-bit deskew circuit select a different input connection (ofthe twelve coming in). In that configuration, each multi-bit deskewcircuit could take in data from its own programmed subcycle. Twelve suchdeskew circuits would allow data from one subcycle each of twelveconnections to be deskewed. Another example of a configuration for usingsuch a system would have each multi-bit deskew circuit accept data froma single connection (single before it branched to reach each separatemulti-bit deskew circuit that is). Such a configuration of deskewcircuits would allow data from up to twelve different subcycles on thatsingle connection to be deskewed (in embodiments with twelve or moresubcycles per user cycle). A set of twelve multi-bit deskew circuitscould also handle any other combination of twelve connection/subcyclepairs.

A twelve deskew circuit embodiment is illustrated in FIG. 22. The figureshows twelve deskew circuits 2210-2221. Each deskew circuit has twelveconnections 2230-2241 to the multiplexer selecting its input. Theseconnections 2230-2241 split off from connections 2250, which come fromthe top transport network layer (not shown). It should be noted that inorder to cope with data from multiple subcycles some embodiments includeconsiderably more deskew circuits than the number of connections 2250.Some embodiments may include X*Y 1-bit deskew circuits (enough to deskewall potential incoming bits), or even more (for example for redundancy).However, some embodiments with twelve 1-bit connections and eightsubcycles per user cycle include sixty or seventy-two 1-bit deskewcircuits. These embodiments allow most of the 96 (12*8) possibleincoming bits to be deskewed, without using up IC area on deskewcapacity that might never be needed.

FIGS. 23-24 illustrate multiple bit sets of data bits coming in ondifferent subcycles and connections (alternatively called “wires”). Theembodiment illustrated in FIGS. 23-24 has twelve connections(represented by twelve columns), and has four subcycles per user cycle(represented as repeating subcycles 0-3). In FIG. 23, grid 2300 showstwo multi-bit words comprising bits a0-a5 and b0-b5. All of the bitswere produced in the configurable circuits of a configurable IC in usercycle zero (UC0). Each column of grid 2310 represents the signals comingout of a transport network (on its way to the deskew circuits) on agiven connection, over many subcycles.

For example, bit a0 (the zeroth bit of word “a”) comes out of thetransport network on wire 0, nine subcycles later than b1 (the first bitof word “b”) comes out of the transport network on wire 7. The relativedelays among the bits may have many causes, but the multi-bit deskewcircuits of some embodiments can compensate for the relative delay.Individual multi-bit deskew circuits delay each bit before passing it tothe trigger circuits. The delay of each bit is by just enough to alignthem when they reach the trigger, recreating the simultaneity that theyhad when they were generated in the configurable circuits of theconfigurable IC. The recreated simultaneity allows the trigger to act onthe multi-bit words as two multi-bit words, rather than separate bitscoming in at different times.

FIG. 23 illustrates a case where only the one instance of each of thetwo multi-bit word sets need be deskewed. In the more general case,multiple instances of the multi-bit words will come into the deskewcircuits. In some cases, an instance of each word will be generated ineach user cycle. FIG. 24 depicts this type of case, in which multipleinstances of the multi-bit words come in, shown in grids 2400 and 2410.Note that each bit still comes in during a particular subcycle and on aparticular wire. Grid 2400 represents multiple instances of the datawords (e.g., UDS data words) as generated in the configurable circuits,one instance in each row UC0-UC7. Grid 2400 shows data bits in the usercycle in which they are generated. In some embodiments, the illustrateddata bits in grid 2400 may be generated in different subcycles of thesame user cycle. The deskew circuits restore chronological order to thedata so that data that was generated in the same cycle (user cycle insome embodiments, subcycle in others) reaches the trigger at the sametime. Grid 2410 represents the data as it arrives at the deskewcircuits.

In this figure all bits represented in the diagram by a0-# aresuccessive instances of the bit a0, with the place of each bit in theorder of succession being shown by the “#” value, and all bitsrepresented in the diagram by a1-# are successive instances of the bita1 and so forth. In some embodiments, all bits a1-# are generated at thesame tile and subcycle as each other (in successive user cycles), allbits a2-# are generated in the same tile and subcycle as each other,etc. In this illustration, they reach the deskew circuits in successiveuser cycles on their respective connections. Each bit a1-# comes in onwire 1 and subcycle 1, and all bits b3-# come in on wire 9 and subcycle3. The multi-bit deskew circuits, once configured for a particular setof delays, send data to the trigger in the same temporal order as it wasgenerated in the tiles of the configurable IC. In this example, thedeskew circuits would delay all bits b1-# by some number of subcyclesand delay all bits a3-# by one more subcycle than that, and so on. Thus,the trigger can compare successive instances of the two multi-bit wordsuntil it finds the combination of bits on which it is set to trigger.For instance the trigger could compare the word made up of bits a0-0 toa5-0 and the word made up of bits b0-0 to b5-0, and then compare theword made up of bits a0-1 to a5-1 and the word made up of bits b0-1 tob5-1 and so on. Thus restoring the simultaneity (within the same usercycle if not the same subcycle) that the data words (e.g., UDS datawords) had when they were generated. In short, deskewing the data.

E. Multiple Transport Network Layer Activated Triggers

In some embodiments, the deskew circuits have multiplexers with moreinputs than the number of connections from one of the transport networklayers. This allows additional flexibility in getting data to the deskewcircuits and the trigger circuits. Any number of transport layers couldgo into a multi-input deskew circuit, but some embodiments saveresources by having all outputs of one layer going to each multi-inputdeskew circuit and only some outputs of a second layer going to themulti-input deskew circuits. In some embodiments, the outputs of atransport layer may be divided up among the multi-input deskew circuits.Such embodiments may have multi-input multiplexers that each receive asinputs all or substantially all the connections from one transportnetwork layer plus some fraction of the inputs from one or more othertransport network layers.

For instance, FIGS. 25 and 26 illustrate embodiments where the deskewcircuits have multiplexers with 16 inputs, some of which receive datafrom a second transport network layer. FIG. 25 illustrates the inputs ofvarious deskew circuits. The inputs include multiplexers 2510, 2520 and2530. The multiplexers 2510, 2520 and 2530 each receive twelve inputs2512, 2522 and 2532 from the top transport network layer (not shown).The multiplexer 2510 receives a set of four inputs 2514 from a secondtransport network layer (not shown). The multiplexer 2520 receives asecond set of four inputs 2524 from the second transport network layer.The multiplexer 2530 receives a third set of four inputs 2534 from thesecond transport network layer. The multiplexers in FIG. 25 showexamples of the connections to individual multiplexers of someembodiments. In actual deskew circuits of some embodiments, there may be60 or 72 1-bit deskew circuits and their attendant multiplexers. Somefraction of the multiplexers (for example ⅓ each) of some embodimentsmay have input sources like those of multiplexers 2510, 2520, and 2530.In some embodiments, the fractions are approximate, so for exampleembodiments with either ⅓ or approximately ⅓ of the multiplexers havinginput sources in common may be referred to as having “about ⅓” of themultiplexers having input sources in common. The term “about” in thiscontext means “equal to or nearly equal to”.

FIG. 26 illustrates the connections from the transport network layers incontext of the trace buffer 960, deskew circuits 2670 and triggernetwork 2680, and the connections 952, 954, and 956. The figure showsthree sets of 4-bit connections 2658, each of these three sets of 4-bitsconnections 2658 connects to the inputs 2514, 2524, and 2534 as seen inFIG. 25 (not shown in FIG. 26). The sets of 4-bit connections lead from12-bit connection 954 to deskew circuits 2670. As has been mentionedpreviously, multiple individual connections are illustrated as oneconnection for purposes of clarity. The separation of the connectionsinto separate lines is conceptual, rather than physical. In someembodiments, the sets of 4-bit connections 2658 may be physicallyseparated, and in other embodiments they may be grouped together.

As described above in relation to FIG. 25, in some embodiments, about ⅓of the deskew circuits each receive connections from about a third ofthe connections from one transport network layer. For example, FIGS. 25and 26, illustrate embodiments in which each transport network layer hastwelve outputs, all twelve outputs from one transport layer areconnected to the inputs of each multi-bit deskew circuit, one third ofthe outputs from a second transport layer are connected to the inputs ofone third of the multi-bit deskew circuits, another third of the outputsfrom the second transport layer are connected to the inputs of anotherthird of the multi-bit deskew circuits, and so on. Alternate embodimentsof triggers which may receive data from multiple transport networklayers may use other fractions of the outputs of a transport layerconnected to other fractions of the multi-bit deskew circuits. Forexample, some embodiments may have half the outputs connected to halfthe deskew circuits, and the other half of the outputs connected to theother half of the deskew circuits. Other embodiments may use some butnot all of the connections from a second transport network layer,connecting them to some or all of the deskew circuits. Still otherembodiments may use connections from more than two transport networklayers. Still other embodiments may have fractions of outputs that don'tmatch the fractions of deskew circuits to which they connect, forexample, half the outputs connect to each of a quarter of the deskewcircuits. In still other embodiments, different multi-bit deskewcircuits may have different numbers of inputs.

IX. Software Reconstruction of Signals in the Trace Buffer

Data (e.g., UDS data) from the configurable circuits can take also takevarying amounts of time to reach a trace buffer. In some embodiments,this means that data produced with some particular chronologicalrelationship in the configurable circuits will reach the trace buffer ina jumbled chronological relationship. For example, a bit generatedearlier than a second bit may arrive at the trace buffer before thesecond bit. Or in another example, two bits generated simultaneously mayarrive at the trace buffer, but do not reach the trace buffersimultaneously. In some embodiments, simultaneously means to within oneuser cycle. In other embodiments, simultaneously means to within onesubcycle. In some embodiments, software is used to restore the originalchronological relationship to data from the trace buffer.

This is similar to the situation described earlier in which data arrivesat the deskew circuits out of order. However, the trigger hardware worksbest when it is receiving data as close to real time as possible. Ifconditions indicating an error, or other reason for stopping, are to befound within the data, it must be found soon enough to stop the tracebuffer before the relevant data in the trace buffer has beenover-written by irrelevant data. Unlike data going to the trigger, thedata in the trace buffer itself is not so time sensitive. Once thetrigger has stopped the writing of data to the trace buffer, there isample time to offload the trace buffer data from the IC for analysis ata more convenient time.

The extra time to offload the trace buffer data from the IC withoutdeskewing it first eliminates the need for deskew circuitry on the ICitself to process data entering the trace buffer.

Instead of such hardware on the IC, a software program can be used todetermine which signals should be considered to be simultaneous. In someembodiments, the same deskewing could be implemented in hardware, insideor outside of the configurable IC. Therefore, it will be clear to one ofordinary skill in the art that processes referenced here as “software”or “implemented by software” could be implemented by hardware orfirmware in some embodiments. The software temporally aligns the data.In some embodiments, temporally aligning may mean generating an orderedset of data. In other embodiments, it may mean outputting the data inthe actual order it was received. In still other embodiments, it maymean providing multiple or all data bits with a relative or absolutetime code to indicate when they were generated relative to other bits.

FIG. 27 illustrates a flow-chart 2700 for such a process of someembodiments. In some embodiments, the process is implemented bysoftware. The software receives data describing the configuration of theconfigurable IC (at 2705). This data includes information about whichphysical locations and subcycles of the configurable IC are beingmonitored. In this context, “monitored” means that the values in thoselocations and at those subcycles are being streamed to the trace buffer.The data provided to the software also includes descriptions of thecircuit paths that each bit of the streaming data (e.g., UDS data) takesto reach the trace buffer. In this context a description may be verybroad or very narrow. In some embodiments, the description may be assimple as a list of delays from relevant circuit elements to a tracebuffer. In some embodiments, the description may include specificconnections on which the data from given circuit elements will reach thetrace buffer.

In some embodiments, the configuration/debug network may not have enoughcapacity in a particular column of tiles to send all the monitoredsignals generated in that column to the transport network. In suchembodiments, the paths may include some of the routing fabric of theconfigurable IC (as further described below by reference to FIGS. 35 aand 35 b), as well as the configuration/debug network. The paths mayalso include storage elements in a transport network such as thosedescribed in relation to FIG. 11 above, or any combination of the abovedescribed elements.

The software (at 2710 in FIG. 27) of these embodiments determines thedelays for data (e.g., UDS data) traveling from each monitoredlocation/subcycle to the trace buffer. When a trigger event occurs (at2715) the trace buffer stops receiving data and sends it out to thedebug software. The software receives the raw data from the trace buffer(also at 2715). The raw data, having been recorded by the trace bufferwithout compensation for signal time, is out of order relative to theactual times that each piece of data was generated within theconfigurable tiles of the configurable IC. The software (at 2720)re-orders the data to reflect the actual times that the bits of datawere generated, using the known delays from different monitored pointsas a map to the re-ordering. In some embodiments, the data comes in as abig set of values in the order they were received at the trace buffer.The process reorders them by taking the original position of each databit in the trace buffer, and subtracting from that position the numberof clock cycles it took that bit of data to get from the configurablecircuits of the IC to the trace buffer. This is similar to the deskewingof data done by the deskewing circuits described in relation to FIG.14-26. However, deskewing data from the trace buffer data can be done atany time after the data has been recorded, and does not have to be doneright away.

Note that in some embodiments, the deskew software does not receive dataon the configuration and paths (as in 2705) then calculate the delays(at 2710), but rather receives data on the monitored values and isprovided with pre-calculated delays from other software such as thedynamic data tracker, as further described below in reference to FIG.34. As further described below in section X, some embodiments of thedynamic data tracker produce data on delays as part of their function.

Other embodiments of the process illustrated in FIG. 27 may have otherfeatures, or implement the described actions in different orders. Forexample, in some embodiments, the determination of the delays for data(e.g., UDS data) reaching the trace buffer may be done after the triggerhas stopped new data from being recorded in the trace buffer.

The net effect of the deskew software is to provide a set of “snapshots”of the values of elements in the configurable circuit at each subcycle.In some embodiments, this snapshot is not of the values of everyelement, but only of the elements that are of interest.

This method of using trace buffers and software deskewing overcomes alimitation of some prior art configurable ICs which froze the IC on atrigger event and then read each element of the frozen IC. Those priorart ICs could only provide a “snapshot” of one particular moment, not“snapshots” of several subcycle's worth of data (e.g., UDS data).

The external deskewing process should not be confused with the processthat reconstructs user design anchor points (described below). Theexternal deskewing process takes raw data from the trace buffer andturns it into a set of “snapshots” of the values of the physicalelements of the IC at multiple subcycles. The anchor pointreconstruction software described below takes as its input snapshots ofthe value of the physical elements of the IC at multiple subcycles. Inother words, the external deskewing process of some embodiments providesthe data values (e.g., UDS data values) from the IC, but does notprovide data about user design elements that were eliminated in therestructuring process. The external deskewing process is one way ofgenerating IC data for the anchor point reconstruction, but the anchorpoint reconstruction process does not require that the particularembodiments described above provide that data. Additionally, feeding theanchor point reconstruction software is not the only reason to havedeskewing software. In some embodiments, the “snapshots” of themonitored elements may themselves be important debugging data.

X. Software Generation of Physical Ic Configuration

Ideally, the software controlling the configurable IC during debuggingprocesses should be transparent to the user. The user should only haveto concern himself with the user design and should be able to interactwith the system without knowing about subcycles, or restructuring of thelogic of the user design to work more efficiently with the physicalconfigurable IC. This transparency should not force the use of larger,more expensive configurable ICs necessary to do a point by point mappingof the user design onto the configurable IC.

One method of improving IC performance is “optimization”, this is theprocess of re-arranging and replacing circuits within the integratedcircuit design so as to accomplish the same end results while improvingperformance. Improving performance could mean using a smaller area, orfewer circuit elements. Prior art configurable integrated circuitdesigns could not track user design signals (the values of outputs ofcircuits in the user design) in the face of optimization of the circuitfor efficient implementation on a configurable IC. It should be notedthat in this specification, optimization is a separate and distinctprocess from changing the logic gates to better match the implementingcircuits of the configurable IC.

In order to achieve these goals, some embodiments of the presentinvention use various software innovations to maintain thistransparency, even in the face of optimization. Such embodiments trackthe user design circuits through optimization, restructuring, and/orretiming of the initial user design circuit. In some embodiments,particular outputs in the user design circuit can be reconstructed evenafter several types of operations such as: 1) optimization of thecircuit design, 2) the initial translation of the optimized user designto a physical layout of the configurable chip; 3) allowing the user torequest debug data dynamically; 4) reconfiguring the routing fabric toretrieve necessary data (e.g., UDS data); 5) using software to deskewthe raw received data; 6) regenerating the user's requested data fromthe deskewed data, if necessary.

A. Initial Translation of User Design to Physical Layout

In some embodiments, the process that configures the configurable IC toimplement the user's design goes through several stages. A flowchart ofthese stages, as implemented by software, is illustrated in FIG. 28.Illustration of this type of translation for examples of very simpleuser design circuits can be found in FIGS. 29, 31, and 32. Theconfiguration software receives a user design layout (at 2805). The userdesign layout, also referred to as a user design circuit, is a softwaredescription of logic elements and the relationships (e.g., connections)between them. Together, these elements and relationships describe thecircuit that the user wants to implement with the configurable IC. Insome embodiments, a user design circuit can be provided from the outputof some external circuit design program. In other embodiments, the usercan construct the circuit using software that is part of the embodimentitself, or by an automatic design program. In still others the user canconstruct the circuits using an evolutionary algorithm for circuitdesign, or by a reverse translation from an existing configuration ofthe configurable IC (with or without subsequent modifications). In stillothers the user could use any other way of providing the information tothe software of the embodiment, or by some combination of the above.

At 2810, the software translates the user design layout into a softwarerepresentation (also known as a “netlist”) of the same circuit, but withtrivial name cells at each output of each user design element. Namecells are described in detail below, in relation to FIGS. 29, 31 and 32,but for now suffice it to say that they are passive elements that willnot be translated to elements on the actual physical configuration. At2815, the software restructures the software representation to replaceat least some of the user design elements with elements that implementthe functions of the original design, but are more efficientlyimplemented on the configurable IC. For example, in some embodiments,the configurable tiles include three-input look-up tables. When properlyconfigured, a three-input lookup table can often replace two two-inputlogic gates. For example, in a circuit design in which the output of oneAND gate feeds into the input of another AND gate, a three input look-uptable (“LUT”) can replace the two AND gates (see FIG. 29 below). Itshould be noted that configurable ICs three input LUTs are merely someof the possible embodiments of the present invention. Other embodimentsmight have four, or even more, input LUTs, or even some other circuitdesigned to replace multiple gates. Still other embodiments may replacegates with some number of inputs greater than the gates or LUTs of theconfigurable IC with multiple gates or LUTs on the configurable IC. At2820, the software representation is translated into a softwarerepresentation very close to the eventual physical configuration of theconfigurable IC. In some embodiments, the software representation atthis point includes both the physical locations and subcycle assignmentsof all the active components. At this point, the only difference betweenthe software representation and the eventual actual configuration of theconfigurable IC is that the software representation still includes thename cells. At 2825, the software determines what configuration packetsneed to be sent to the configurable IC to implement the actualconfiguration and sends the packets. The software retains a copy of thesoftware representation of 2820 for reasons that will be explainedlater.

Other embodiments are also possible, for instance, the software couldcombine one or more steps, or skip some steps. Some embodiments maygenerate name cells as needed to keep track of changes rather thangenerating trivial name cells for each user design element and thentranslating to more complex name cells. Some embodiments may combine theactions described in 2815 and 2820, or even 2810 to 2820 into one morecomplicated set of actions. In the embodiments described above, eachaction is applied to the entire circuit design before the next action isapplied to the entire circuit. Other embodiments may perform anequivalent process piecemeal, with each type of action from 2805 to 2825applied to some small part of the circuit before applying each type ofaction from 2805 to 2825 to some other small part of the circuit. Otherembodiments may implement some sets of actions piecemeal and other setsof actions across the entire circuit.

B. Keeping Track of User Design Signals

1. Tracking Through Space

The debugging operations of some embodiments may require data (e.g., UDSdata) from specific points within the user design circuit. In somecases, the optimization, restructuring, and/or translation of a userdesign circuit to a physical configuration might eliminate some of thesespecific points from the physical design (e.g., eliminate an output of alogic circuit when it eliminates the logic circuit from the designduring some optimization operation). Therefore, some embodiments providesoftware tracking of such points, referred to below as “anchor points”,also referred to as “examination points”. The software keeps track ofthe input and output locations in the user design circuit that areneeded for debugging operations. As these anchor points cannot betracked directly, as demonstrated in FIG. 29 below, the software instead(1) determines the inputs that affect the values at the specified anchorpoints, (2) commands the debugging hardware to track the values of thoseinputs, and (3) translates the values of those inputs into the valuethat each of the anchor points would have had, if the restructuring ofthe user design circuit that not eliminated them from the physicalcircuit.

2. Anchor Points and Lost Anchor Points

For example, FIG. 29 illustrates a user design circuit 2910, with twotwo-input AND gates 2912 and 2916, inputs 2912 a, 2912 b, and 2916 a,and outputs 2912 c and 2916 c. For this example, the software willgenerate data necessary to reconstruct the value of the output 2912 c ofAND gate 2912. Therefore, output 2912 c is an anchor point. In thisspecification, an “anchor point” refers to an output or input of acircuit element in the user design circuit whose value is to be tracked.Any output of any element in the user design is potentially an anchorpoint. Which outputs or inputs are anchor points at any given timevaries as the debugging software changes focus. An anchor point thatdoes not have a corresponding point in the physical configuration of theconfigurable is referred to here as a “lost anchor point”. As lostanchor points have no direct equivalents in the physical circuit, thevalue of a lost anchor point cannot be directly read from the physicalcircuit.

If the physical circuit were identical to the user design circuit, thenthere would be no lost anchor points, and the value of the output 2912 ccould be read directly. However, translation of the user design circuit2910 to a physical circuit could produce (for example) physical circuit2940, which includes a single three-input AND gate 2946 with inputs 2942a, 2942 b and 2946 a, and output 2946 c. The physical circuit 2940 hasthe same logic table as the user design circuit 2910, and so would havethe same functions in normal operations. However, no point correspondingto output 2912 c exists within physical circuit design 2940. In thisexample, output 2912 c is a lost anchor point, and thus its value cannotbe read directly.

3. Name Cells, Trivial and Reconstructing

To prepare the system to be able to recover the values of lost anchorpoints, the translation software of some embodiments generates “namecells” to keep track of the relationships between potential anchorpoints of the user design circuit and the readable points of thephysical cells. A “name cell” as used in this specification is asoftware representation that is used to keep track of the value of aparticular anchor point. Name cells are inactive, serving as virtualmaps of circuit elements rather than being circuit elements themselves.There are multiple types of name cells, described below and in the nextsection.

A “trivial name cell” is a name cell that simply keeps track of aparticular location where the value of the anchor point can be directlyread. In embodiments with subcycles, the name cells may keep track ofsubcycles as well as location. A “reconstructing name cell” is a namecell that tracks lost anchor points that have been lost when translatingfrom a user design to a physical configuration of a configurable IC. Areconstructing name cell keeps track of at least one location and (insome embodiments) subcycles in a circuit. It also keeps track of theinput(s) of the physical circuit that correspond to the input(s) of thelogic circuit(s) leading to the anchor point in the user design circuit.A reconstructing name cell also keeps track of the logic necessary toreconstruct the value of the anchor point given the values of theinputs.

4. Translation from User Design Circuit to Physical Configuration

In some embodiments, the anchor points are not determined in advance. Inorder to ensure that all possible anchor points can be reconstructed,these embodiments generate name cells for all outputs in the user designcircuit (along with any inputs from outside the user design circuit). InFIG. 29 the process of translating from user design circuit to physicalcircuit starts with the user design circuit 2910. This circuit istranslated to software representation 2920 of the user design circuit2910. This translation maintains the logic of the user design circuit,but adds trivial name cells 2927 and 2929.

The software representation 2920 is translated to a softwarerepresentation 2930 that represents a circuit with functions equivalentto the user design circuit 2910, but that can be implemented using a3-input AND gate 2936 on the configurable IC. In the process, thetrivial name cells 2927 and 2929 are translated to reconstructing namecell 2937 and trivial name cell 2939. Reconstructing name cell 2937keeps track of the locations/subcycles of inputs 2932 a and 2932 b, andkeeps track of the logic necessary to reconstruct anchor point 2912 c.Here, the logic is AND gate 2935. The output 2938 represents the valuethat the reconstructing name cell reconstructs. In some embodiments, thesoftware representation 2930 includes arrangements of circuit elements,placements within subcycles, and positions of elements within the tilearray of the configurable IC. In terms of the flowchart in FIG. 28above, translating from software representation 2920 to softwarerepresentation 2930 combines the actions in 2815 and 2820, thoughsubcycle assignments are not illustrated here for the sake of clarity.The software maintains a copy of the software representation 2930 andgenerates a physical circuit design 2940 that is then implemented on theconfigurable IC.

In this example, the anchor point is the output 2912 c. The inputs thataffect the value at the anchor point 2912 c are the inputs 2912 a and2912 b. The software tracks the locations of the equivalent inputs 2932a and 2932 b in software representation 2930. If it is later necessaryto supply the value of the anchor point, user design output 2912 c, thesoftware would order the hardware to read these values from thecorresponding inputs 2942 a and 2942 b. The software would use the logictable of reconstructing name cell 2937 to reconstruct the value thatoutput 2912 c would have had.

FIG. 29 illustrates an example of a fairly simple restructuringoperation, some of which may be done in order to better match theimplementing circuits of the configurable IC. Some embodiments trackuser design circuits through optimization operations that are done forreasons other than matching the implementing circuits of theconfigurable IC. FIG. 30 illustrates some examples of more complexreplacement of circuit elements in an optimization process. FIG. 30shows a circuit 3005 made from five logic gates: AND gates 3010 and3012, OR gate 3014, NOT gates 3016 and 3018. Circuit 3005 has inputs3005 a and 3005 b.

Two possible replacement circuits 3025 and 3035 are also illustrated.Possible replacement circuit 3025 is an XOR gate, possible replacementcircuit 3035 has a NOT gate 3036 and a two-input multiplexer 3037. Notethat possible replacement circuit 3035 includes a circuit element whichis not a logic gate. Circuit 3005 and possible replacement circuits 3025and 3035 each provide the same outputs in response to a given set ofinput values. In the case of circuit 3005, the input values come in oninputs 3005 a and 3005 b. In the case of possible replacement circuit3025, the input values come in on inputs 3025 a and 3025 b. In the caseof possible replacement circuit 3035, the input values come in on inputs3035 a and 3035 b. The inputs 3025 a-b and 3035 a-b are correspondinginputs to inputs 3005 a-b. AND gate 3010 has an output 3011, for whichthere is no corresponding output in either potential replacementcircuits 3025 or 3035. Some embodiments use a reconstructing name cellsuch as 3040, with its output 3041, to track the user design values ofoutput 3011.

In some embodiments, the inputs that directly affect the value of ananchor point may themselves be translated out of the physical circuit.In such cases, the software goes back to the nearest inputs that havenot been translated out of the physical circuit, and commands thedebugging hardware to track those inputs. In such embodiments, thesoftware reconstructs the network of relationships that lead to theanchor point. Such networks may involve dozens, or even hundreds ofinputs that affect the value of an anchor point. Some embodiments treateach node in the network as its own subsidiary name cell. Suchembodiments calculate from one subsidiary anchor point to the next,starting from physical inputs and working through to the anchor pointsneeded for debugging. Other embodiments may construct a single largelogic table in a large reconstructing name cell to translate thephysical inputs directly into the anchor point needed for debugging.

5. Tracking Through Time

In some embodiments, the user design circuit may contain elements thatare designed to delay a signal for some number of user cycles beforepassing it on to the next element in the circuit. Translation of a userdesign circuit into a physical circuit configuration of the configurableIC may move some of these elements from one side of an anchor point toanother in such a way that the anchor point is lost. Unlike the earlierexample, the physical location (and subcycle, if any) of these lostanchor points can still be read directly. However, directly reading thevalues at these locations/subcycles results in getting a value from anearlier or later clock cycle (e.g., user design clock cycle) than theuser design circuit anchor point would.

In order to compensate for these changes in time, the softwareintroduces “timeshift name cells” into the software representations.Timeshift name cells track a single input location, like trivial namecells, but they also keep track of the number of user cycles that thephysical circuit location is behind or ahead of the correspondinglocation in the user design circuit. FIGS. 31-32 illustrate two examplesof tracking anchor points through time shifts of some embodiments. InFIG. 31, user design 3110 includes buffers 3112 and 3114 that delay anysignals coming in on inputs 3112 a and 3114 a (respectively) by one usercycle. Thus, in the user design, output 3112 c “sees” a value one usercycle later than the input 3112 a. In this example, output 3112 c willbe an anchor point. The user design circuit also includes AND gate 3116with output 3116 a. The overall effect of this user design circuit is todelay the values coming in on inputs 3112 a and 3114 a, then AND thevalues together after the delay, and send the resulting value to output3116 a.

The software translates the user design circuit into a softwarerepresentation 3120 that includes trivial name cells 3125, 3127, and3129. The software then translates the software representation 3120 intosoftware representation 3130. This translation does not have bufferscorresponding to 3112 and 3114. This representation has a buffer 3138after an AND gate 3136. The overall effect of the circuit represented bysoftware representation 3130 is to take two inputs 3132 a and 3134 a,then AND them together, then delay the resulting value before sending itto the output connected to trivial name cell 3139. The circuitrepresented in software representation 3130 (given the same inputs)produces the same values at its final output, and with the same timedelay, as user design circuit 3110. In terms of the flowchart in FIG. 28above, translating from software representation 3120 to softwarerepresentation 3130 combines the actions in 2815 and 2820, thoughsubcycle assignments are not illustrated here for the sake of clarity.

Internally, the absence of these buffers from the softwarerepresentation means that the name cells reading the inputs 3132 a and3134 a read them without delays corresponding to the delay produced inthe user design circuit 3110 by buffers 3112 and 3114. To allow thesoftware to compensate for the lack of a delay, the trivial name cells3125 and 3127 are translated to timeshift name cells 3135 and 3137,respectively. The time shift of those cells would be plus one each.Trivial name cell 3129 is after the delay, but so is name cell 3139, soname cell 3139 is a trivial name cell.

To reconstruct the value that would be found at the anchor point, output3112 c, in a given user cycle, the reconstructing software would findthe value at physical input 3142 a of the physical configuration 3140.However, rather than using the value at the same time as a trivial namecell would, the reconstructing software would use the value produced oneuser cycle later. One user cycle later corresponds to the time shift ofplus one tracked in timeshift name cell 3137.

FIG. 32 illustrates a translation that produces two name cells at thesame location, but with one name cell being a trivial name cell and theother being a timeshift name cell. In FIG. 32 user design circuit 3210has a buffer 3218 after the output 3216 a of AND gate 3216. Buffer 3218has an output 3218 a. The user design circuit is translated intosoftware representation 3220. Software representation 3220 has a trivialname cell 3227 at the output of AND gate 3226, and another trivial namecell 3229 at the output of buffer 3228. The translation to softwarerepresentation 3230 (again omitting subcycle assignments for clarity)shifts the delay to before AND gate 3236 by providing buffers 3232 and3234 and providing no buffer corresponding to buffer 3218. Trivial namecell 3239 remains on the same side of the delay as trivial name cell3229. However, trivial name cell 3227 was before the delay in softwarerepresentation 3220 and the corresponding name cell 3237 in softwarerepresentation 3230 is after the delay. Thus, the corresponding namecell 3237 in software representation 3230 must be a timeshift name cell.Both trivial name cell 3239 and timeshift name cell 3237 track the samelocation/subcycle of the physical configuration 3240, namely the output3246 a of the AND gate 3246. However, timeshift name cell 3237 indicatesthat to reconstruct the value of output 3216 a the reconstructionsoftware would have to use the value at output 3246 a one user cyclebefore the requested time. Trivial name cell 3239 indicates that toreconstruct the value of output 3218 a the reconstruction software wouldhave to use the value at output 3246 a in the same user cycle asrequested.

The above embodiments are examples; other embodiments are possiblewithin the scope of the invention. It should also be noted that otherembodiments may use other terminology, or represent timeshift name cellsas just another reconstructing name cell, with one input, that has abuffer as its internal logic. It should also be noted that the timeshiftname cells of the described embodiments are separate from the deskewsoftware functions described elsewhere in this specification. As notedin the description of the deskew software functions, the effect of thedeskew software functions of some embodiments is to reconstruct a“snapshot” of the monitored elements of the physical configuration. Theeffect of the name cell generating software functions of the embodimentsdescribed above is to generate a guide for translating values from thatsnapshot into values the debug software or user is seeking. However,other embodiments may combine the functions of the deskew network andtimeshift name cells into one part of the software.

The above descriptions of some embodiments assume that the output of anyphysical element on any tile can be read by the configuration/debugnetwork, either directly or through the routing fabric. In someembodiments, points other than the outputs of user design elements canbe read directly from the tiles by the configuration/debug network. Insuch embodiments, some inputs of name cells can be read from those otherpoints, rather than having to look back to the outputs of the precedinguser design elements. However, in some embodiments, the outputs of someelements on the tile cannot be read directly by the configuration/debugnetwork or the routing network. For example, in some embodiments, theconfiguration/debug network can only read from RMUXs or latchesconnected to RMUXs, or in some embodiments, only from a subset of theRMUXs. In such embodiments, the output of a circuit element could onlybe read if it happened to connect to the input of a readable RMUX. Infact, such an RMUX would not only have to be readable, but also notoccupied with passing data from its other inputs. In such embodiments,the name cells also reconstruct the user signals from the availableoutputs, as seen in FIG. 33.

FIG. 33 illustrates a further adaptation of the name cells inembodiments where not all outputs of elements on the tiles are directlyaccessible. FIG. 33 includes software representation 2930, as seen inFIG. 29, including the components and name cells from that softwarerepresentation. In this figure, the inputs 2932 a and 2932 b areconnected to the outputs of OR gates 3350 and 3352 respectively. Asreconstructing name cell 2937 indicates, the signal at output 2938 canbe reconstructed from the inputs 2932 a and 2932 b. However, in theexample illustrated here, there is no direct connection between theoutputs of the OR gates and the configuration/debug network (not shown),and also no direct connection between the inputs 2932 a and 2932 b andthe configuration/debug network. Thus, in order to reconstruct thesignal at output 2938, the software must generate and then use a mapgoing back to the inputs of the OR gates. In some embodiments, thesoftware must go still further back along the chain of inputs, but hereit is assumed that each of the inputs 3350 a, 3350 b, 3352 a, and 3352 bcan be read by the configuration/debug network.

In order to be able to determine the value at output 2938, the softwareenhances the reconstructing name cell to include the entire network ofdependencies back to the nearest readable inputs, in this case inputs3350 a, 3350 b, 3352 a, and 3352 b. The software includesrepresentations of these OR gates 3350 and 3352, and their inputs in thereconstructing name cell 3377 as OR gates 3370 and 3372 and their inputs3370 a, 3370 b, 3372 a, and 3372 b. As in previously described namecells, these components are not implemented on the IC, but aremaintained as a software representation that can be used to reconstructsignals read from the configurable IC.

XI. Tracking Data Dynamically

The software of some embodiments allows a user to determine which userdesign elements should be monitored during the running of theconfigurable IC. FIG. 34 illustrates a flowchart of some embodiments fordynamic tracking of data. In this context, “dynamic” tracking allows theuser to select, while the IC is already running, which user data valuesshould be monitored. Some embodiments are set up so that dynamictracking is able to configure the IC and/or the debug network to trackthe new data in less than an hour. Other embodiments are set up so thatthis configuration to track the new data takes under a minute. Stillother embodiments are set up so that it takes less than ten seconds toconfigure to track new data. Still others are set up so that it takes,less than a second to reconfigure to track the new data. Still othersare set up so that it takes less than one hundred milliseconds toreconfigure to track the new data.

When implementing a particular user design, a configurable IC performsuser-design operations that allow the IC to implement the particularuser design in a circuit or device. During such user-design operations,the configurable IC (1) can receive user-design input data, which areneither configuration signals nor clocking signals, and (2) can processthese signals to implement the particular user design in a circuit ordevice. The processing of these signals may go on for an arbitraryamount of time after user-design input data has been received. Theprocessed results of such user-design input data can be characterized asuser-design data.

Accordingly, in some cases, a configurable IC performs user-designoperations when it receives and processes user-design input data andprovides user-design output data. For instance, when the configurable ICperforms user-design operations, its configurable logic circuits in somecases can receive user-design input data, compute functions based on theuser-design input data, and output their results to other circuitsinside or outside of the IC. In other contexts, a configurable IC mightimplement a user design that simply directs the IC to generate outputwithout receiving any user-design input. The IC is “running” while it isreceiving user design input data, processing user-design input data,processing user-design data, providing user-design output data or anycombination of the previous (this is sometimes called “run time”). Insome embodiments, the configuration of the debug network, transportnetwork, trace buffer, or routing fabric is done during run time.

The software receives (at 3405) a command from a user to monitor thevalue of the output of a particular user design component. The software(at 3410) accesses a software representation of the configuration of theIC that includes data about which physical elements of the configurableIC must be read to provide or reconstruct the output of the user designcomponent. The software determines (at 3415) where there are open slotsets in the trace buffer, as described in section VIII. The softwaredetermines (at 3420) whether any open slot sets in the trace buffer canbe reached by use of the configuration/debug and transport networks. Thedata bit from that element must be timed to reach the trace buffer atthe same time as an open slot is ready to receive it, taking intoaccount the delays in reaching the trace buffer from the element ofinterest. The determination requires consideration of congestion of theconfiguration/debug and transport networks and the number of subcyclesit would take for data from the element of interest to reach the openslot set.

If the data can reach an open slot set using just theconfiguration/debug and transport networks, then the software doesn'thave to find a path using the routing fabric. In such cases, ittransitions to 3430, and at 3430, the software reconfigures theconfiguration/debug and/or transport networks as needed to get the data(e.g., UDS data) to an open slot set.

If the data cannot reach an open slot set using just theconfiguration/debug and transport networks, then the software (at 3425)finds a path through the routing fabric (as further described byreference to FIGS. 35 a-35 b) that does get the data to an open slotset. This may require routing to avoid congestion, or routing to add anadditional delay, or both. In cases where the routing fabric is used,the software (at 3430) reconfigures the software representation of thephysical layout of the configurable IC to match the changes in therouting fabric. The software may also (still at 3430) reconfigure thesoftware representation of configuration/debug and transport networks.The software sends configuration packets to reconfigure the actualconfigurable IC accordingly. The effect of this reconfiguration is toprepare the routing fabric to send data from the element of interest toanother tile. When data reaches that other tile, it is picked up by theconfiguration/debug network, passed on to the transport network and thensent to the trace buffer, arriving just as the assigned slot is ready toreceive it.

In some embodiments, such a path will use routing elements not engagedin implementing whatever user design the IC is implementing (or at leastrouting circuits not used in a particular clock cycle or sub-cycle incase of a reconfigurable IC), while leaving those that are engaged inimplementing the user design alone. One advantage of using the otherwiseidle routing elements is that the implementation of the user design doesnot have to be reconfigured to get the data out.

In either case, the software representation keeps track of the path thedata takes. In some embodiments, it keeps track of the slot set to whichthe data is assigned. This information can be used by the softwaredeskewer described in section IX to deskew the data, providing a “set ofsnapshots” of the elements of interest at particular times. In someembodiments, the “snapshots” are used by the user design signal trackersdescribed in section X to reconstruct the values of the user designelements that the user has requested.

FIG. 35 a illustrates a congested condition on a column of tiles. Forthe sake of clarity, this figure illustrates an embodiment with aconfiguration/debug network that is 4-bits wide, though otherembodiments may use other widths (e.g., 12-bits). Also for the sake ofclarity, the RMUXs are represented in the figure as connecting directlyto the configuration/debug network lines. It will be clear to one ofordinary skill in the art that in some embodiments there will becircuitry between the RMUXs and the configuration/debug network lines(e.g., mask and merge circuits, etc.)

In FIG. 35 a, the circuit elements used to implement the user design areshown as being shaded, including the RMUXs that help to connect thevarious tiles used to implement the user design. Elements not being usedto implement the user design are shown as being unshaded. RMUXs are usedto select connections from other RMUXs and from logic circuits (onlyselected connections are shown here). FIG. 35 a includes two columns oftiles, 3500 and 3540. Column 3500 includes tiles with RMUXs 3510, 3512,3514, 3516, and 3518. Column 3540 includes a tile with RMUX 3550. Forthe sake of clarity, the outputs of each of those six RMUXs are said tobe of interest within the same subcycle. However, it will be clear toone of ordinary skill in the art that as there are time delays inherentin bits coming from different tiles in the same column, it would be moreaccurate to say “in subcycles such that all four lines of theconfiguration/debug network would be occupied at the time when the fifthRMUX would need to send its signal”.

The configuration/debug network lines 3505 and 3545 of this figure canonly handle O-bits (each) in a given subcycle. Therefore, in order tosend five signals from the same column, the debugging software of someembodiments can command the RMUXs that are not engaged in implementingthe user design to accept output from the RMUXs of interest and passthem along to a column with less congestion. FIG. 35 a represents a setof conditions in which RMUXs 3510, 3512, 3514, and 3516 are sendingtheir outputs to the configuration/debug network line 3505 and the RMUX3550 is sending its output to the configuration/debug network line 3545.With all the available capacity of the configuration/debug network line3505 taken up already, the RMUX 3518 can't connect to it (as representedby the line from RMUX 3518 that dead ends in an X). While theconfiguration/debug network line 3505 is at full capacity, theconfiguration/debug network line 3545 only has one RMUX outputting to itand thus has excess capacity.

FIG. 35 b illustrates the same pair of columns as FIG. 35 a, but withthe RMUX 3552 configured to accept the output of RMUX 3518, and pass iton to the configuration/debug network line 3545. Accordingly, in thiscase RMUX 3552 (part of the ICs routing fabric) is used to transportsignals to parts of the configuration/debug network with the capacity tohandle them.

In some embodiments, data from any of the RMUXs of interest could besent to another column in order to receive the congestion. However, insome embodiments, not every RMUX is set up with a connection to anothercolumn. It should also be noted that routing to another column canintroduce its own delays and that not all embodiments will always routeto the nearest other column, for example if that column is itselfcongested. It will be clear to one of ordinary skill in the art that insome embodiments, the configuring of otherwise idle routing elements toavoid congestion may be implemented in the initial configuration, eitherin addition to, or instead of reconfiguring the routing elementsdynamically.

Many of the above-described processes (such as the processes illustratedin FIGS. 27, 28, and 34) are implemented as software processes that arespecified as a set of instructions recorded on a machine readable medium(also referred to as computer readable medium). When these instructionsare executed by one or more computational element(s) (such as processorsor other computational elements like FPGAs), they cause thecomputational element(s) to perform the actions indicated in theinstructions. Computer is meant in its broadest sense, and can includeany electronic device with a processor. Examples of computer readablemedia include, but are not limited to, CD-ROMs, flash drives, RAM chips,hard drives, EPROMs, etc.

In this specification, the term “software” is meant in its broadestsense. It can include firmware residing in read-only memory. Also, insome embodiments, multiple software inventions can be implemented assub-parts of a larger program while remaining distinct softwareinventions. In some embodiments, multiple software inventions can alsobe implemented as separate programs. Finally, any combination ofseparate programs that together implement a software invention describedhere is within the scope of the invention. Any of the software functionsdescribed above, which involve user input or providing data to a user,can be implemented using a graphical user interface (GUI). For example,commanding that a particular element in the user design circuit bemonitored can be implemented using a graphical user interface.

As used in this document, a configurable IC is an IC that includesconfigurable circuits such as configurable logic circuits and/orconfigurable interconnect circuits. Typically, such configurablecircuits are organized in a particular arrangement (e.g., an array). Aconfigurable IC can also include circuits other than a configurablecircuit arrangement and I/O circuitry.

FIG. 36 illustrates one such system. Specifically, it illustrates asystem on chip (“SoC”) implementation of a configurable IC 3600. This IChas a configurable block 3650, which includes a configurable circuitarrangement 3660, with configurable circuits/tiles 3670, and I/Ocircuitry 3665 for this arrangement. It also includes a processor 3615outside of the configurable circuit arrangement, a memory 3620, and abus 3610, which conceptually represents all conductive paths between theprocessor 3615, memory 3620, and the configurable block 3650. As shownin FIG. 36, the IC 3600 couples to a bus 3630, which communicativelycouples the IC to other circuits, such as an off-chip memory 3625. Bus3630 conceptually represents all conductive paths between the componentsof the IC 3600. The IC 3600, the bus 3630 and the memory 3625 are partsof an electronic device that might include other circuitry (such asdisplay, input/output interface, processors, etc.).

This processor 3615 can read and write instructions and/or data from anon-chip memory 3620 or an offchip memory 3625. The processor 3615 canalso communicate with the configurable block 3650 through memory 3620and/or 3625 through buses 3610 and/or 3630. Similarly, the configurableblock can retrieve data from and supply data to memories 3620 and 3625through buses 3610 and 3630.

Instead of, or in conjunction with, the system on chip (“SoC”)implementation for a configurable IC, some embodiments might employ asystem in package (“SiP”) implementation for a configurable IC. One suchapproach is described further in U.S. Pat. No. 7,224,181.

FIG. 37 conceptually illustrates a computer system that can be used toimplement the processes (such as the processes illustrated in FIGS. 27,28, and 34) of some embodiments of the invention. System 3700 of thisfigure includes a bus 3705, a processor 3710, several computer readablemedia (including a system memory 3715, a read-only memory 3720, and apermanent storage device 3725), input devices 3730, and output devices3735.

The bus 3705 collectively represents all system, peripheral, and chipsetbuses that support communication among internal devices of the system3700. For instance, the bus 3705 communicatively connects the processor3710 with the read-only memory 3720, the system memory 3715, and thepermanent storage device 3725.

One or more of the various memory units (3715, 3725, etc.) store theabove-descried data structures with the content pieces, verificationparameters, and content keys. From these various memory units, theprocessor 3710 (or another computational element 3710) retrievesinstructions to execute and data to process in order to execute theprocesses of the invention. The read-only-memory (ROM) 3720 storesstatic data and instructions that are needed by the processor 3710 andother modules of the system.

The permanent storage device 3725, on the other hand, is aread-and-write memory device. This device is a non-volatile memory unitthat stores instruction and data even when the system 3700 is off. Someembodiments of the invention use a mass-storage device (such as amagnetic or optical disk and its corresponding disk drive) as thepermanent storage device 3725. Other embodiments use a removable storagedevice (such as a memory card or memory stick) as the permanent storagedevice.

Like the permanent storage device 3725, the system memory 3715 is aread-and-write memory device. However, unlike storage device 3725, thesystem memory is a volatile read-and-write memory, such as a randomaccess memory. The system memory stores some of the instructions anddata that the processor needs at runtime. In some embodiments, theinvention's processes are stored in the system memory 3715, thepermanent storage device 3725, and/or the read-only memory 3720.

The bus 3705 also connects to the input and output devices 3730 and3735. The input devices enable the user to communicate information andselect commands to the system. The input devices 3730 includealphanumeric keyboards and cursor-controllers. The output devices 3735display images generated by the system. The output devices includeprinters and display devices, such as cathode ray tubes (CRT) or liquidcrystal displays (LCD).

Finally, as shown in FIG. 37, certain configurations of the system 3700also include a network adapter 3740 that connects to the bus 3705.Through the network adapter 3740, the system can be a part of a networkof computers (such as a local area network (“LAN”), a wide area network(“WAN”), an Intranet or a network of networks, e.g., the Internet). Anyor all of the components of system 3700 may be used in conjunction withthe invention. However, one of ordinary skill in the art will appreciatethat any other system configuration may also be used in conjunction withthe invention.

While the invention has been described with reference to numerousspecific details, one of ordinary skill in the art will recognize thatthe invention can be embodied in other specific forms without departingfrom the spirit of the invention. For instance, several embodiments weredescribed above by reference to particular number of inputs, outputs,bits, and bit lines. One of ordinary skill will realize that thesevalues are different in different embodiments. Thus, one of ordinaryskill in the art would understand that the invention is not to belimited by the foregoing illustrative details, but rather is to bedefined by the appended claims.

We claim:
 1. An integrated circuit (IC) comprising: an arrangement ofcircuits comprising a plurality of configurable circuits forconfigurably performing a plurality of operations; a plurality of signalpaths for monitoring signals generated by the plurality of configurablecircuits and for outputting the monitored signals; and a transportnetwork for transporting the monitored signals outputted by theplurality of signal paths to a set of destination circuits, wherein thetransport network is divided into a plurality of sections, each sectionof at least some of the plurality of sections for transporting aselected data bit to a next section of the transport network, whereinthe selected data bit is selected from (i) a data bit transported from aprevious section of the transport network and (ii) a monitored signaloutputted by one of the plurality of signal paths.
 2. The IC of claim 1,wherein a last section of the transport network is for transporting aselected data bit to the set of destination circuits, wherein theselected data bit is selected from (i) a data bit transported from aprevious section of the transport network and (ii) a monitored signaloutputted by one of the plurality of signal paths.
 3. The IC of claim 1,wherein a beginning section of the transport network is for transportinga monitored signal outputted by one of the plurality of signal paths toa next section of the transport network.
 4. The IC of claim 1, whereintwo consecutive sections of the transport network are interconnected bya set of storage elements.
 5. The IC of claim 1, wherein the eachsection of the at least some of the plurality of sections comprises aset of storage elements for delaying a monitored data bit outputted byone of the plurality of signal paths when the section is transportingthe data bit transported from the previous section.
 6. The IC of claim1, wherein the plurality of signal paths monitors signals generated bythe plurality of configurable circuits by sampling once every clockcycle.
 7. The IC of claim 6, wherein each clock cycle is divided into aplurality of sub-cycles, wherein each data bit transported by thetransport network traverses one section of the transport network in onesub-cycle.
 8. The IC of claim 1, wherein the set of destination circuitscomprises a trace buffer.
 9. The IC of claim 1, wherein the set ofdestination circuits comprises a trigger circuit.
 10. The IC of claim 9,wherein the set of destination circuits further comprises a deskewcircuit.
 11. An electronic device comprising: an integrated circuit (IC)comprising: an arrangement of circuits comprising a plurality ofconfigurable circuits for configurably performing a plurality ofoperations; a plurality of signal paths for monitoring signals generatedby the plurality of configurable circuits and for outputting themonitored signals; and a transport network for transporting themonitored signals outputted by the plurality of signal paths to a set ofdestination circuits, wherein the transport network is divided into aplurality of sections, each section of at least some of the plurality ofsections for transporting a selected data bit to a next section of thetransport network, wherein the selected data bit is selected from (i) adata bit transported from a previous section of the transport networkand (ii) a monitored signal outputted by one of the plurality of signalpaths; and a memory device for storing configuration data forconfiguring the plurality of configurable circuits in the IC.
 12. Theelectronic device of claim 11, wherein a last section of the transportnetwork is for transporting a selected data bit to the set ofdestination circuits, wherein the selected data bit is selected from (i)a data bit transported from a previous section of the transport networkand (ii) a monitored signal outputted by one of the plurality of signalpaths.
 13. The electronic device of claim 11, wherein a beginningsection of the transport network is for transporting a monitored signaloutputted by one of the plurality of signal paths to a next section ofthe transport network.
 14. The electronic device of claim 11, whereintwo consecutive sections of the transport network are interconnected bya set of storage elements.
 15. The electronic device of claim 11,wherein the each section of the at least some of the plurality ofsections comprises a set of storage elements for delaying a monitoreddata bit outputted by one of the plurality of signal paths when thesection is transporting the data bit transported from the previoussection.
 16. The electronic device of claim 11, wherein the plurality ofsignal paths monitors signals generated by the plurality of configurablecircuits by sampling once every clock cycle.
 17. The electronic deviceof claim 16, wherein each clock cycle is divided into a plurality ofsub-cycles, wherein each data bit transported by the transport networktraverses one section of the transport network in one sub-cycle.
 18. Theelectronic device of claim 11, wherein the set of destination circuitscomprises a trace buffer.
 19. The electronic device of claim 11, whereinthe set of destination circuits comprises a trigger circuit.
 20. Theelectronic device of claim 19, wherein the set of destination circuitsfurther comprises a deskew circuit.